/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 10:39:52,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 10:39:52,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 10:39:52,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 10:39:52,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 10:39:52,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 10:39:52,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 10:39:52,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 10:39:52,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 10:39:52,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 10:39:52,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 10:39:52,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 10:39:52,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 10:39:52,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 10:39:52,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 10:39:52,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 10:39:52,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 10:39:52,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 10:39:52,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 10:39:52,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 10:39:52,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 10:39:52,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 10:39:52,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 10:39:52,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 10:39:52,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 10:39:52,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 10:39:52,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 10:39:52,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 10:39:52,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 10:39:52,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 10:39:52,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 10:39:52,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 10:39:52,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 10:39:52,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 10:39:52,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 10:39:52,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 10:39:52,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 10:39:52,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 10:39:52,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 10:39:52,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 10:39:52,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 10:39:52,324 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 10:39:52,339 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 10:39:52,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 10:39:52,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 10:39:52,340 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 10:39:52,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 10:39:52,341 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:39:52,341 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 10:39:52,341 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 10:39:52,341 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 10:39:52,341 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 10:39:52,342 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 10:39:52,342 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 10:39:52,342 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 10:39:52,342 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 10:39:52,342 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:52,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 10:39:52,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 10:39:52,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 10:39:52,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 10:39:52,343 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 10:39:52,343 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 10:39:52,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 10:39:52,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 10:39:52,344 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 10:39:52,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:39:52,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 10:39:52,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 10:39:52,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 10:39:52,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 10:39:52,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 10:39:52,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 10:39:52,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 10:39:52,535 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 10:39:52,536 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 10:39:52,536 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:39:52,602 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_WZszo9/tmp/f44dea1167f64de596b6a691bcc0f32b/FLAGd7f79176f [2020-07-01 10:39:52,941 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 10:39:52,942 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:39:52,948 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_WZszo9/tmp/f44dea1167f64de596b6a691bcc0f32b/FLAGd7f79176f [2020-07-01 10:39:53,344 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_WZszo9/tmp/f44dea1167f64de596b6a691bcc0f32b [2020-07-01 10:39:53,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 10:39:53,357 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 10:39:53,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 10:39:53,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 10:39:53,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 10:39:53,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638a227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53, skipping insertion in model container [2020-07-01 10:39:53,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 10:39:53,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 10:39:53,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:39:53,611 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 10:39:53,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:39:53,641 INFO L208 MainTranslator]: Completed translation [2020-07-01 10:39:53,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53 WrapperNode [2020-07-01 10:39:53,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 10:39:53,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 10:39:53,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 10:39:53,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 10:39:53,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 10:39:53,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 10:39:53,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 10:39:53,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 10:39:53,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 10:39:53,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 10:39:53,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 10:39:53,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 10:39:53,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (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 10:39:53,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 10:39:53,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 10:39:53,908 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 10:39:53,909 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 10:39:53,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:39:53 BoogieIcfgContainer [2020-07-01 10:39:53,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 10:39:53,913 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 10:39:53,913 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 10:39:53,915 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 10:39:53,916 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:39:53" (1/1) ... [2020-07-01 10:39:53,928 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-07-01 10:39:53,929 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 10:39:53,930 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 10:39:53,931 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 10:39:53,931 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:39:53,933 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 10:39:53,933 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 10:39:53,934 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 10:39:53,947 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 10:39:53,960 INFO L200 BlockEncoder]: SBE split 1 edges [2020-07-01 10:39:53,964 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 10:39:53,966 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:39:53,979 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 10:39:53,981 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 10:39:53,983 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:39:53,983 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:39:53,983 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 10:39:53,984 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:39:53,984 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges [2020-07-01 10:39:53,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:39:53 BasicIcfg [2020-07-01 10:39:53,985 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 10:39:53,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 10:39:53,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 10:39:53,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 10:39:53,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 10:39:53" (1/4) ... [2020-07-01 10:39:53,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f61329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:39:53, skipping insertion in model container [2020-07-01 10:39:53,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (2/4) ... [2020-07-01 10:39:53,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f61329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:39:53, skipping insertion in model container [2020-07-01 10:39:53,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:39:53" (3/4) ... [2020-07-01 10:39:53,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f61329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:39:53, skipping insertion in model container [2020-07-01 10:39:53,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:39:53" (4/4) ... [2020-07-01 10:39:53,993 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:39:54,003 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 10:39:54,010 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 10:39:54,024 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 10:39:54,046 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 10:39:54,047 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 10:39:54,047 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:39:54,047 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:39:54,047 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:39:54,047 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 10:39:54,047 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:39:54,048 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 10:39:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-07-01 10:39:54,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 10:39:54,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-07-01 10:39:54,120 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 10:39:54,121 INFO L271 CegarLoopResult]: At program point L13-1(lines 9 18) the Hoare annotation is: true [2020-07-01 10:39:54,121 INFO L268 CegarLoopResult]: For program point L10(lines 10 12) no Hoare annotation was computed. [2020-07-01 10:39:54,121 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 18) no Hoare annotation was computed. [2020-07-01 10:39:54,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:39:54 BasicIcfg [2020-07-01 10:39:54,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 10:39:54,130 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 10:39:54,130 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 10:39:54,134 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 10:39:54,135 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:39:54,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 10:39:53" (1/5) ... [2020-07-01 10:39:54,135 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47f389e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:39:54, skipping insertion in model container [2020-07-01 10:39:54,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:39:54,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:39:53" (2/5) ... [2020-07-01 10:39:54,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47f389e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:39:54, skipping insertion in model container [2020-07-01 10:39:54,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:39:54,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:39:53" (3/5) ... [2020-07-01 10:39:54,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47f389e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:39:54, skipping insertion in model container [2020-07-01 10:39:54,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:39:54,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:39:53" (4/5) ... [2020-07-01 10:39:54,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47f389e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:39:54, skipping insertion in model container [2020-07-01 10:39:54,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:39:54,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:39:54" (5/5) ... [2020-07-01 10:39:54,139 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:39:54,168 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 10:39:54,168 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 10:39:54,168 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:39:54,168 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:39:54,168 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:39:54,169 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 10:39:54,169 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:39:54,169 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 10:39:54,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-01 10:39:54,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:39:54,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:54,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:54,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 10:39:54,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:39:54,196 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 10:39:54,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-01 10:39:54,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:39:54,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:54,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:54,198 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 10:39:54,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:39:54,203 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5#L13-1true [2020-07-01 10:39:54,203 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3#L10true [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 6#L10-2true [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L13-1true [2020-07-01 10:39:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2020-07-01 10:39:54,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:54,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419185658] [2020-07-01 10:39:54,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 64827, now seen corresponding path program 1 times [2020-07-01 10:39:54,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:54,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568125899] [2020-07-01 10:39:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1911869, now seen corresponding path program 1 times [2020-07-01 10:39:54,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:54,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711919577] [2020-07-01 10:39:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:54,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:54,381 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:54,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:54,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:54,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:54,383 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:54,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:54,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:54,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:54,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 10:39:54,384 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:54,384 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:54,403 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 10:39:54,414 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 10:39:54,419 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 10:39:54,497 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:54,498 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 10:39:54,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:54,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:54,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:54,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 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 10:39:54,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:54,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:54,553 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:54,553 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:54,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:54,586 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:54,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:54,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:54,629 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:54,659 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:54,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:54,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:54,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:54,659 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:54,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:54,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:54,660 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:54,660 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 10:39:54,660 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:54,660 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:54,662 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 10:39:54,667 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 10:39:54,671 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 10:39:54,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:54,754 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:54,758 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 10:39:54,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:54,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:54,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:54,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:54,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:39:54,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:39:54,775 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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:54,808 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 10:39:54,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:54,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:54,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:54,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:54,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:39:54,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:39:54,820 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:54,874 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 10:39:54,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:54,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:54,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:54,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:54,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:54,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:54,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:54,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:54,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:54,889 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:54,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:54,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:54,898 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:54,899 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 10:39:54,933 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:54,963 WARN L262 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:54,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:54,974 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:39:54,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:54,987 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 10:39:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:55,021 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:39:55,022 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:55,049 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 10:39:55,054 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 10:39:55,056 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. [2020-07-01 10:39:55,143 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 20 states and 34 transitions. Complement of second has 10 states. [2020-07-01 10:39:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-01 10:39:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 10:39:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-01 10:39:55,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-01 10:39:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-01 10:39:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-01 10:39:55,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2020-07-01 10:39:55,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:39:55,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 26 transitions. [2020-07-01 10:39:55,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-01 10:39:55,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-01 10:39:55,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 26 transitions. [2020-07-01 10:39:55,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:55,167 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 26 transitions. [2020-07-01 10:39:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 26 transitions. [2020-07-01 10:39:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-01 10:39:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 10:39:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2020-07-01 10:39:55,198 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 22 transitions. [2020-07-01 10:39:55,198 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 22 transitions. [2020-07-01 10:39:55,198 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 10:39:55,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 22 transitions. [2020-07-01 10:39:55,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:39:55,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:55,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:55,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 10:39:55,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:39:55,200 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 82#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 76#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 77#L10-2 [2020-07-01 10:39:55,201 INFO L796 eck$LassoCheckResult]: Loop: 77#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 83#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 84#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 77#L10-2 [2020-07-01 10:39:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 61658, now seen corresponding path program 1 times [2020-07-01 10:39:55,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208326772] [2020-07-01 10:39:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 66477, now seen corresponding path program 2 times [2020-07-01 10:39:55,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322511584] [2020-07-01 10:39:55,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1836890164, now seen corresponding path program 1 times [2020-07-01 10:39:55,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225191250] [2020-07-01 10:39:55,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:55,257 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:55,258 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:55,258 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:55,258 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:55,258 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:55,259 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:55,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:55,259 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:55,259 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 10:39:55,259 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:55,259 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:55,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:55,265 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 10:39:55,272 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 10:39:55,330 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:55,330 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:55,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:55,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:55,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:55,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:55,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:55,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:55,380 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:55,380 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:55,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:55,414 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:55,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:55,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:55,508 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:55,510 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:55,510 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:55,510 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:55,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:55,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:55,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:55,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:55,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:55,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 10:39:55,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:55,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:55,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:55,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:55,519 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 10:39:55,585 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:55,585 INFO L489 LassoAnalysis]: Using template 'affine'. 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 10:39:55,592 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 10:39:55,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:55,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:55,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:55,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:55,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:39:55,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:39:55,603 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 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 10:39:55,640 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 10:39:55,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:55,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:55,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:55,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:55,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:39:55,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:39:55,651 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:55,685 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 10:39:55,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:55,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:55,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:55,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:55,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:55,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:55,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:55,693 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:55,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:55,698 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:55,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:55,706 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:55,706 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:55,707 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-01 10:39:55,738 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:55,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:55,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:55,774 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:39:55,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:55,785 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 10:39:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:55,798 WARN L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:39:55,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:55,850 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 10:39:55,850 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 4 loop predicates [2020-07-01 10:39:55,851 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 22 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-01 10:39:55,948 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 22 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 26 states and 45 transitions. Complement of second has 12 states. [2020-07-01 10:39:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-01 10:39:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 10:39:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2020-07-01 10:39:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-01 10:39:55,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-01 10:39:55,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-01 10:39:55,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:55,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 45 transitions. [2020-07-01 10:39:55,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 10:39:55,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 37 transitions. [2020-07-01 10:39:55,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-01 10:39:55,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-01 10:39:55,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 37 transitions. [2020-07-01 10:39:55,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:55,956 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. [2020-07-01 10:39:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 37 transitions. [2020-07-01 10:39:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-07-01 10:39:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 10:39:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-07-01 10:39:55,959 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-07-01 10:39:55,960 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-07-01 10:39:55,960 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 10:39:55,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 34 transitions. [2020-07-01 10:39:55,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 10:39:55,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:55,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:55,961 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:55,961 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:39:55,962 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 183#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 177#L10 [2020-07-01 10:39:55,962 INFO L796 eck$LassoCheckResult]: Loop: 177#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 178#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 186#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 177#L10 [2020-07-01 10:39:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 1 times [2020-07-01 10:39:55,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48656830] [2020-07-01 10:39:55,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash 59803, now seen corresponding path program 1 times [2020-07-01 10:39:55,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300938430] [2020-07-01 10:39:55,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash 59254520, now seen corresponding path program 1 times [2020-07-01 10:39:55,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:55,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354162067] [2020-07-01 10:39:55,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:55,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:56,015 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:56,016 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:56,016 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:56,016 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:56,016 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:56,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:56,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:56,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:56,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 10:39:56,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:56,017 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:56,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:56,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:56,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:56,082 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:56,082 INFO L404 LassoAnalysis]: Checking for nontermination... 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 10:39:56,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:56,086 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:56,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:56,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:56,131 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:56,161 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:56,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:56,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:56,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:56,162 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:56,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:56,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:56,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:56,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 10:39:56,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:56,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:56,165 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 10:39:56,172 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 10:39:56,175 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 10:39:56,245 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:56,245 INFO L489 LassoAnalysis]: Using template 'affine'. 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 10:39:56,248 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 10:39:56,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:56,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:56,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:56,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:56,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:56,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:56,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:56,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:56,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:56,260 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:56,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:56,265 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:56,265 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:56,265 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2020-07-01 10:39:56,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:56,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,333 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 10:39:56,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:56,358 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 10:39:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,383 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 10:39:56,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:56,385 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 10:39:56,386 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 4 loop predicates [2020-07-01 10:39:56,386 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 34 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-07-01 10:39:56,513 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 34 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 100 states and 173 transitions. Complement of second has 50 states. [2020-07-01 10:39:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-01 10:39:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 10:39:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-01 10:39:56,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-01 10:39:56,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:56,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-01 10:39:56,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:56,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 10:39:56,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:56,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 173 transitions. [2020-07-01 10:39:56,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 10:39:56,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 33 states and 60 transitions. [2020-07-01 10:39:56,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-01 10:39:56,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-01 10:39:56,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 60 transitions. [2020-07-01 10:39:56,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:56,525 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 60 transitions. [2020-07-01 10:39:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 60 transitions. [2020-07-01 10:39:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 13. [2020-07-01 10:39:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 10:39:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-07-01 10:39:56,527 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-07-01 10:39:56,527 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-07-01 10:39:56,527 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 10:39:56,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 22 transitions. [2020-07-01 10:39:56,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 10:39:56,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:56,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:56,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:56,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:39:56,529 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 400#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 395#L10 [2020-07-01 10:39:56,529 INFO L796 eck$LassoCheckResult]: Loop: 395#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 396#L10-2 [43] L10-2-->L13-1: Formula: (and (> v_ULTIMATE.start_main_~i~0_9 30) (= v_ULTIMATE.start_main_~i~0_8 20)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 404#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 395#L10 [2020-07-01 10:39:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 2 times [2020-07-01 10:39:56,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:56,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143482] [2020-07-01 10:39:56,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,536 INFO L82 PathProgramCache]: Analyzing trace with hash 59989, now seen corresponding path program 1 times [2020-07-01 10:39:56,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:56,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385702003] [2020-07-01 10:39:56,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,568 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 10:39:56,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385702003] [2020-07-01 10:39:56,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:39:56,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:39:56,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538231801] [2020-07-01 10:39:56,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 10:39:56,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:39:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:39:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:39:56,577 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-01 10:39:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:39:56,597 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-07-01 10:39:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:39:56,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2020-07-01 10:39:56,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 10:39:56,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2020-07-01 10:39:56,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 10:39:56,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 10:39:56,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2020-07-01 10:39:56,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:56,600 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-01 10:39:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2020-07-01 10:39:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-01 10:39:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 10:39:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2020-07-01 10:39:56,602 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-07-01 10:39:56,602 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-07-01 10:39:56,602 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 10:39:56,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2020-07-01 10:39:56,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 10:39:56,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:56,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:56,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:56,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-07-01 10:39:56,604 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 435#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 430#L10 [2020-07-01 10:39:56,604 INFO L796 eck$LassoCheckResult]: Loop: 430#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 431#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 437#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 432#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 433#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 443#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 430#L10 [2020-07-01 10:39:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 3 times [2020-07-01 10:39:56,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:56,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219062859] [2020-07-01 10:39:56,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1781634639, now seen corresponding path program 1 times [2020-07-01 10:39:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:56,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134872122] [2020-07-01 10:39:56,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 19890130, now seen corresponding path program 2 times [2020-07-01 10:39:56,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:56,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299878410] [2020-07-01 10:39:56,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:56,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:56,660 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:56,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:56,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:56,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:56,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:56,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:56,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:56,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:56,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 10:39:56,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:56,662 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:56,663 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 10:39:56,666 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 10:39:56,671 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 10:39:56,703 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:56,703 INFO L404 LassoAnalysis]: Checking for nontermination... 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 10:39:56,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:56,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:56,710 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:56,711 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 10:39:56,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:56,743 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:56,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:56,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:56,783 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:56,812 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:56,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:56,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:56,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:56,813 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:56,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:56,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:56,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:56,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 10:39:56,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:56,813 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:56,815 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 10:39:56,821 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 10:39:56,825 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 10:39:56,871 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:56,872 INFO L489 LassoAnalysis]: Using template 'affine'. 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 10:39:56,876 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 10:39:56,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:56,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:56,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:56,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:56,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:56,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:56,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:56,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:56,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:56,885 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 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 10:39:56,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:56,888 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:56,888 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:56,888 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 53 Supporting invariants [] [2020-07-01 10:39:56,918 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:56,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:56,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:39:56,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:39:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,116 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 10:39:57,117 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 7 loop predicates [2020-07-01 10:39:57,117 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 22 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-01 10:39:57,396 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 22 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 140 states and 184 transitions. Complement of second has 120 states. [2020-07-01 10:39:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 2 accepting loop states [2020-07-01 10:39:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 10:39:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-07-01 10:39:57,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 10:39:57,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:57,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-01 10:39:57,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:57,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 12 letters. [2020-07-01 10:39:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:57,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 184 transitions. [2020-07-01 10:39:57,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-07-01 10:39:57,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 35 states and 51 transitions. [2020-07-01 10:39:57,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 10:39:57,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 10:39:57,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 51 transitions. [2020-07-01 10:39:57,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:57,410 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 51 transitions. [2020-07-01 10:39:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 51 transitions. [2020-07-01 10:39:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2020-07-01 10:39:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 10:39:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-07-01 10:39:57,412 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 10:39:57,413 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 10:39:57,413 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 10:39:57,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 32 transitions. [2020-07-01 10:39:57,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 10:39:57,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:57,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:57,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:57,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2020-07-01 10:39:57,414 INFO L794 eck$LassoCheckResult]: Stem: 833#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 834#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 829#L10 [2020-07-01 10:39:57,415 INFO L796 eck$LassoCheckResult]: Loop: 829#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 830#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 839#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 831#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 832#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 836#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 837#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 841#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 843#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 829#L10 [2020-07-01 10:39:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 4 times [2020-07-01 10:39:57,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:57,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151676] [2020-07-01 10:39:57,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash -528270053, now seen corresponding path program 2 times [2020-07-01 10:39:57,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:57,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849299303] [2020-07-01 10:39:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -158580552, now seen corresponding path program 3 times [2020-07-01 10:39:57,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:57,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386549063] [2020-07-01 10:39:57,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:57,478 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:57,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:57,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:57,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:57,479 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:57,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:57,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:57,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:57,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-07-01 10:39:57,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:57,479 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:57,480 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 10:39:57,483 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 10:39:57,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:57,519 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:57,519 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:57,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:57,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:57,526 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:57,526 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:57,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:57,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:57,562 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:39:57,562 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 10:39:57,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:57,593 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 10:39:57,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:57,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:57,633 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:57,662 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:57,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:57,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:57,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:57,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:57,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:57,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:57,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:57,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-07-01 10:39:57,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:57,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:57,664 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 10:39:57,668 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 10:39:57,672 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 10:39:57,702 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:57,702 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:57,705 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 10:39:57,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:57,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:57,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:57,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:57,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:39:57,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:39:57,713 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:57,744 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 10:39:57,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:57,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:57,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:57,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:57,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:57,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:57,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:57,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:57,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:57,753 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 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 10:39:57,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:57,756 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:57,756 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:57,756 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2020-07-01 10:39:57,785 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:39:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,894 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,899 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:57,903 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:57,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 10:39:57,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:58,003 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-07-01 10:39:58,003 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 8 loop predicates [2020-07-01 10:39:58,003 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 32 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-07-01 10:39:58,242 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 32 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 242 states and 300 transitions. Complement of second has 152 states. [2020-07-01 10:39:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2020-07-01 10:39:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 10:39:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-07-01 10:39:58,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 9 letters. [2020-07-01 10:39:58,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:58,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 11 letters. Loop has 9 letters. [2020-07-01 10:39:58,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:58,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 18 letters. [2020-07-01 10:39:58,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:58,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 300 transitions. [2020-07-01 10:39:58,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-07-01 10:39:58,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 37 states and 53 transitions. [2020-07-01 10:39:58,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 10:39:58,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 10:39:58,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 53 transitions. [2020-07-01 10:39:58,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:58,265 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 53 transitions. [2020-07-01 10:39:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 53 transitions. [2020-07-01 10:39:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2020-07-01 10:39:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 10:39:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-07-01 10:39:58,268 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-01 10:39:58,268 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-01 10:39:58,268 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 10:39:58,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-01 10:39:58,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 10:39:58,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:58,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:58,269 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:58,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2020-07-01 10:39:58,270 INFO L794 eck$LassoCheckResult]: Stem: 1419#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1420#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1415#L10 [2020-07-01 10:39:58,270 INFO L796 eck$LassoCheckResult]: Loop: 1415#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1416#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1422#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1423#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1436#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1437#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1417#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1418#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1433#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1435#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1426#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1431#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1415#L10 [2020-07-01 10:39:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 5 times [2020-07-01 10:39:58,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:58,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015744085] [2020-07-01 10:39:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -932932913, now seen corresponding path program 3 times [2020-07-01 10:39:58,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:58,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782169501] [2020-07-01 10:39:58,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 190844434, now seen corresponding path program 4 times [2020-07-01 10:39:58,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:58,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365014794] [2020-07-01 10:39:58,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:58,368 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:58,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:58,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:58,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:58,369 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:39:58,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:58,369 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:58,369 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:58,369 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 10:39:58,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:58,370 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:58,370 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 10:39:58,375 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 10:39:58,378 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 10:39:58,408 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:58,409 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:58,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:39:58,412 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:39:58,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:39:58,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:39:58,452 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:39:58,481 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:39:58,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:39:58,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:39:58,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:39:58,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:39:58,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:58,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:39:58,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:39:58,482 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 10:39:58,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:39:58,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:39:58,483 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 10:39:58,489 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 10:39:58,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:39:58,526 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:39:58,526 INFO L489 LassoAnalysis]: Using template 'affine'. 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 10:39:58,529 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 10:39:58,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:39:58,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:39:58,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:39:58,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:39:58,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:39:58,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:39:58,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:39:58,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:39:58,538 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:39:58,538 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:39:58,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:39:58,541 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:39:58,541 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:39:58,541 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2020-07-01 10:39:58,571 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:39:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:58,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:39:58,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:58,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 10:39:58,596 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:39:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,738 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,743 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,748 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,754 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,759 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,764 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,769 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,774 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:58,778 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:39:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:39:58,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 10:39:58,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:39:58,790 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 10:39:58,790 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 7 loop predicates [2020-07-01 10:39:58,790 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 35 transitions. cyclomatic complexity: 13 Second operand 7 states. [2020-07-01 10:39:59,018 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 35 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 149 states and 183 transitions. Complement of second has 98 states. [2020-07-01 10:39:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 7 non-accepting loop states 3 accepting loop states [2020-07-01 10:39:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 10:39:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2020-07-01 10:39:59,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 12 letters. [2020-07-01 10:39:59,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:59,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 14 letters. Loop has 12 letters. [2020-07-01 10:39:59,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:59,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2020-07-01 10:39:59,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:39:59,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 183 transitions. [2020-07-01 10:39:59,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-07-01 10:39:59,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 34 states and 47 transitions. [2020-07-01 10:39:59,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 10:39:59,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-01 10:39:59,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2020-07-01 10:39:59,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:39:59,027 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-07-01 10:39:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2020-07-01 10:39:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2020-07-01 10:39:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 10:39:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2020-07-01 10:39:59,029 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-01 10:39:59,029 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-01 10:39:59,029 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 10:39:59,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 38 transitions. [2020-07-01 10:39:59,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 10:39:59,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:39:59,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:39:59,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:39:59,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2020-07-01 10:39:59,031 INFO L794 eck$LassoCheckResult]: Stem: 1807#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1808#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1803#L10 [2020-07-01 10:39:59,031 INFO L796 eck$LassoCheckResult]: Loop: 1803#L10 [30] L10-->L10-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_12 30) (= 25 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1804#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1810#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1811#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1824#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1828#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1827#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1826#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1825#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1805#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1806#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1821#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1823#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1816#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1819#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1803#L10 [2020-07-01 10:39:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 6 times [2020-07-01 10:39:59,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:59,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489494805] [2020-07-01 10:39:59,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,037 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:59,037 INFO L82 PathProgramCache]: Analyzing trace with hash -270995301, now seen corresponding path program 4 times [2020-07-01 10:39:59,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:59,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658294017] [2020-07-01 10:39:59,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:39:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1090123144, now seen corresponding path program 5 times [2020-07-01 10:39:59,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:39:59,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733931173] [2020-07-01 10:39:59,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:39:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:39:59,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:39:59,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:39:59 BasicIcfg [2020-07-01 10:39:59,155 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 10:39:59,158 INFO L168 Benchmark]: Toolchain (without parser) took 5799.83 ms. Allocated memory was 649.6 MB in the beginning and 778.6 MB in the end (delta: 129.0 MB). Free memory was 561.2 MB in the beginning and 574.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 115.3 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,158 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 10:39:59,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.61 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 561.2 MB in the beginning and 654.4 MB in the end (delta: -93.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.49 ms. Allocated memory is still 690.5 MB. Free memory was 654.4 MB in the beginning and 652.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,160 INFO L168 Benchmark]: Boogie Preprocessor took 18.56 ms. Allocated memory is still 690.5 MB. Free memory was 652.2 MB in the beginning and 651.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,160 INFO L168 Benchmark]: RCFGBuilder took 218.19 ms. Allocated memory is still 690.5 MB. Free memory was 651.1 MB in the beginning and 637.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,161 INFO L168 Benchmark]: BlockEncodingV2 took 72.06 ms. Allocated memory is still 690.5 MB. Free memory was 637.4 MB in the beginning and 630.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,161 INFO L168 Benchmark]: TraceAbstraction took 144.04 ms. Allocated memory is still 690.5 MB. Free memory was 629.6 MB in the beginning and 621.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,162 INFO L168 Benchmark]: BuchiAutomizer took 5025.06 ms. Allocated memory was 690.5 MB in the beginning and 778.6 MB in the end (delta: 88.1 MB). Free memory was 621.9 MB in the beginning and 574.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 135.0 MB. Max. memory is 50.3 GB. [2020-07-01 10:39:59,166 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 4 locations, 7 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 283.61 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 561.2 MB in the beginning and 654.4 MB in the end (delta: -93.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.49 ms. Allocated memory is still 690.5 MB. Free memory was 654.4 MB in the beginning and 652.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.56 ms. Allocated memory is still 690.5 MB. Free memory was 652.2 MB in the beginning and 651.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 218.19 ms. Allocated memory is still 690.5 MB. Free memory was 651.1 MB in the beginning and 637.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 72.06 ms. Allocated memory is still 690.5 MB. Free memory was 637.4 MB in the beginning and 630.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 144.04 ms. Allocated memory is still 690.5 MB. Free memory was 629.6 MB in the beginning and 621.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5025.06 ms. Allocated memory was 690.5 MB in the beginning and 778.6 MB in the end (delta: 88.1 MB). Free memory was 621.9 MB in the beginning and 574.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 135.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 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=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 0 deterministic, 6 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 7 locations. One nondeterministic module has affine ranking function -1 * i + 27 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 53 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 12 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 12 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 2.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 7. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/30 HoareTripleCheckerStatistics: 32 SDtfs, 99 SDslu, 0 SDs, 0 SdLazy, 424 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax230 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73189dbf=0, \result=0, i=25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 Loop: [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 10:39:50.074 ----------------------------------------------- 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_WZszo9/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 10:39:59.604 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check