YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:13:55,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:13:55,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:13:55,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:13:55,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:13:55,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:13:55,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:13:55,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:13:55,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:13:55,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:13:55,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:13:55,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:13:55,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:13:55,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:13:55,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:13:55,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:13:55,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:13:55,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:13:55,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:13:55,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:13:55,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:13:55,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:13:55,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:13:55,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:13:55,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:13:55,455 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:13:55,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:13:55,456 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:13:55,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:13:55,457 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:13:55,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:13:55,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:13:55,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:13:55,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:13:55,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:13:55,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:13:55,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:13:55,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:13:55,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:13:55,463 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 02:13:55,478 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:13:55,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:13:55,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:13:55,479 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:13:55,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:13:55,479 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:13:55,479 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:13:55,480 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:13:55,480 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:13:55,480 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:13:55,480 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:13:55,480 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:13:55,480 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:13:55,481 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:13:55,481 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:55,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:13:55,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:13:55,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:13:55,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:13:55,482 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:13:55,482 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:13:55,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:13:55,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:13:55,482 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:13:55,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:13:55,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:13:55,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:13:55,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:13:55,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:13:55,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:13:55,522 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:13:55,526 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:13:55,527 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:13:55,528 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:13:55,528 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:13:55,594 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d01979e6206b4ecb9d12a6254a207887/FLAG9bcc9ae8f [2020-06-22 02:13:55,937 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:13:55,938 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:13:55,945 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d01979e6206b4ecb9d12a6254a207887/FLAG9bcc9ae8f [2020-06-22 02:13:56,355 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d01979e6206b4ecb9d12a6254a207887 [2020-06-22 02:13:56,374 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:13:56,376 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:13:56,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:13:56,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:13:56,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:13:56,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf01b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56, skipping insertion in model container [2020-06-22 02:13:56,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:13:56,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:13:56,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:13:56,631 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:13:56,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:13:56,721 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:13:56,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56 WrapperNode [2020-06-22 02:13:56,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:13:56,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:13:56,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:13:56,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:13:56,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:13:56,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:13:56,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:13:56,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:13:56,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... [2020-06-22 02:13:56,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:13:56,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:13:56,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:13:56,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:13:56,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:13:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:13:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:13:57,030 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:13:57,031 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 02:13:57,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:13:57 BoogieIcfgContainer [2020-06-22 02:13:57,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:13:57,034 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:13:57,034 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:13:57,036 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:13:57,037 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:13:57" (1/1) ... [2020-06-22 02:13:57,054 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 10 edges [2020-06-22 02:13:57,055 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:13:57,056 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:13:57,057 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:13:57,057 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:13:57,059 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:13:57,060 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:13:57,060 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:13:57,077 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:13:57,096 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 02:13:57,101 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:13:57,103 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:13:57,112 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 02:13:57,114 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 02:13:57,116 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:13:57,117 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:13:57,117 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:13:57,117 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:13:57,118 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges [2020-06-22 02:13:57,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:13:57 BasicIcfg [2020-06-22 02:13:57,119 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:13:57,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:13:57,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:13:57,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:13:57,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:13:56" (1/4) ... [2020-06-22 02:13:57,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (2/4) ... [2020-06-22 02:13:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:13:57" (3/4) ... [2020-06-22 02:13:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba8c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:13:57" (4/4) ... [2020-06-22 02:13:57,128 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:13:57,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:13:57,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:13:57,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:13:57,204 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:13:57,205 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:13:57,205 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:13:57,205 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:13:57,205 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:13:57,205 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:13:57,206 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:13:57,206 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:13:57,206 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:13:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 02:13:57,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:13:57,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 02:13:57,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:13:57,295 INFO L451 ceAbstractionStarter]: At program point L22-1(lines 19 24) the Hoare annotation is: true [2020-06-22 02:13:57,295 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 21) no Hoare annotation was computed. [2020-06-22 02:13:57,295 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 19 24) no Hoare annotation was computed. [2020-06-22 02:13:57,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:13:57 BasicIcfg [2020-06-22 02:13:57,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:13:57,306 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:13:57,306 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:13:57,309 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:13:57,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:13:57,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:13:56" (1/5) ... [2020-06-22 02:13:57,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2221ef12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:13:57,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:13:56" (2/5) ... [2020-06-22 02:13:57,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2221ef12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:13:57,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:13:57" (3/5) ... [2020-06-22 02:13:57,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2221ef12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:13:57,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:13:57" (4/5) ... [2020-06-22 02:13:57,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2221ef12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:13:57, skipping insertion in model container [2020-06-22 02:13:57,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:13:57,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:13:57" (5/5) ... [2020-06-22 02:13:57,316 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:13:57,347 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:13:57,347 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:13:57,347 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:13:57,348 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:13:57,348 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:13:57,348 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:13:57,348 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:13:57,348 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:13:57,348 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:13:57,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 02:13:57,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:13:57,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:13:57,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:13:57,378 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:13:57,378 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:13:57,379 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:13:57,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 02:13:57,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:13:57,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:13:57,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:13:57,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:13:57,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:13:57,385 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L22-1true [2020-06-22 02:13:57,386 INFO L796 eck$LassoCheckResult]: Loop: 3#L22-1true [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 6#L20true [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 5#L20-2true [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L22-1true [2020-06-22 02:13:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2020-06-22 02:13:57,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:57,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:57,456 INFO L82 PathProgramCache]: Analyzing trace with hash 59771, now seen corresponding path program 1 times [2020-06-22 02:13:57,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1877022, now seen corresponding path program 1 times [2020-06-22 02:13:57,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:57,606 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:57,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:57,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:57,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:57,607 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:13:57,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:57,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:57,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:57,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:13:57,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:57,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:57,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:57,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:57,739 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:57,739 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:57,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:13:57,749 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:57,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:13:57,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:13:57,840 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:13:57,842 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:57,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:57,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:57,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:57,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:13:57,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:13:57,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:57,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:57,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:13:57,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:57,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:57,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:57,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:57,924 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:57,930 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:13:57,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:13:57,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:13:57,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:13:57,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:13:57,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:13:57,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:13:57,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:13:57,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:13:57,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:13:57,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:13:57,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:13:57,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:13:57,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:13:57,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:13:57,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:13:57,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:13:57,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:13:57,956 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:13:57,964 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:13:57,964 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:13:57,966 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:13:57,967 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:13:57,967 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:13:57,967 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 02:13:57,969 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:13:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:13:58,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:13:58,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:13:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,132 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:13:58,132 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 02:13:58,138 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-06-22 02:13:58,139 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. [2020-06-22 02:13:58,263 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 13 states and 26 transitions. Complement of second has 10 states. [2020-06-22 02:13:58,263 INFO L142 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-06-22 02:13:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:13:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-06-22 02:13:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 02:13:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:13:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 02:13:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:58,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 26 transitions. [2020-06-22 02:13:58,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:13:58,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 10 states and 18 transitions. [2020-06-22 02:13:58,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 02:13:58,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 02:13:58,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. [2020-06-22 02:13:58,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:13:58,286 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 02:13:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. [2020-06-22 02:13:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 02:13:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:13:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-06-22 02:13:58,317 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 02:13:58,317 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 02:13:58,317 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:13:58,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. [2020-06-22 02:13:58,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:13:58,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:13:58,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:13:58,319 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 02:13:58,319 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:13:58,319 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 73#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 71#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 74#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L22-1 [2020-06-22 02:13:58,320 INFO L796 eck$LassoCheckResult]: Loop: 67#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 68#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 76#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L22-1 [2020-06-22 02:13:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1877125, now seen corresponding path program 1 times [2020-06-22 02:13:58,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:58,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:58,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash 59771, now seen corresponding path program 2 times [2020-06-22 02:13:58,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash 86886007, now seen corresponding path program 1 times [2020-06-22 02:13:58,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:58,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:58,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:13:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:13:58,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:13:58,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:13:58,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:13:58,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:13:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:13:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-06-22 02:13:58,646 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:58,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:58,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:58,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:58,646 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:13:58,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:58,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:58,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:58,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:13:58,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:58,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:58,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:58,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-06-22 02:13:58,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:58,722 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:58,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:13:58,727 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:58,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:13:58,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:13:58,797 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:13:58,799 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:58,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:58,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:58,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:58,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:13:58,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:13:58,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:58,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:58,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:13:58,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:58,800 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:58,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:58,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:58,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:58,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:13:58,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:13:58,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:13:58,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:13:58,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:13:58,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:13:58,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:13:58,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:13:58,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:13:58,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:13:58,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:13:58,892 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:13:58,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:13:58,892 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:13:58,892 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:13:58,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-06-22 02:13:58,894 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:13:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:13:58,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:58,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:13:58,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:13:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:58,980 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:13:58,980 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 02:13:58,980 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-06-22 02:13:58,980 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-06-22 02:13:59,080 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 33 states and 63 transitions. Complement of second has 20 states. [2020-06-22 02:13:59,081 INFO L142 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-06-22 02:13:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:13:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-06-22 02:13:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:13:59,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 7 letters. Loop has 3 letters. [2020-06-22 02:13:59,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 02:13:59,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 63 transitions. [2020-06-22 02:13:59,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 02:13:59,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 46 transitions. [2020-06-22 02:13:59,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 02:13:59,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 02:13:59,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 46 transitions. [2020-06-22 02:13:59,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:13:59,089 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. [2020-06-22 02:13:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 46 transitions. [2020-06-22 02:13:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 10. [2020-06-22 02:13:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:13:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-06-22 02:13:59,091 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 02:13:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:13:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:13:59,095 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 8 states. [2020-06-22 02:13:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:13:59,222 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2020-06-22 02:13:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 02:13:59,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 39 transitions. [2020-06-22 02:13:59,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 02:13:59,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 39 transitions. [2020-06-22 02:13:59,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 02:13:59,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 02:13:59,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. [2020-06-22 02:13:59,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:13:59,227 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 39 transitions. [2020-06-22 02:13:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. [2020-06-22 02:13:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2020-06-22 02:13:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 02:13:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-06-22 02:13:59,229 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 02:13:59,229 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 02:13:59,230 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:13:59,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. [2020-06-22 02:13:59,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 02:13:59,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:13:59,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:13:59,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:13:59,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:13:59,232 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L22-1 [2020-06-22 02:13:59,232 INFO L796 eck$LassoCheckResult]: Loop: 247#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 245#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 254#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L22-1 [2020-06-22 02:13:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2020-06-22 02:13:59,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:59,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,237 INFO L82 PathProgramCache]: Analyzing trace with hash 59781, now seen corresponding path program 1 times [2020-06-22 02:13:59,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:13:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1877032, now seen corresponding path program 1 times [2020-06-22 02:13:59,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:59,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,300 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:59,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:59,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:59,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:59,301 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:13:59,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:59,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:59,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:59,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:13:59,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:59,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:59,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:59,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:59,354 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:59,354 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:59,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:13:59,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:13:59,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:13:59,408 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:59,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:13:59,415 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:13:59,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:13:59,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:13:59,637 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:13:59,640 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:13:59,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:13:59,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:13:59,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:13:59,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:13:59,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:13:59,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:13:59,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:13:59,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 02:13:59,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:13:59,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:13:59,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:59,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:13:59,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:13:59,703 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:13:59,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:13:59,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:13:59,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:13:59,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:13:59,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:13:59,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:13:59,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:13:59,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:13:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:13:59,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:13:59,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:13:59,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:13:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:13:59,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:13:59,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:13:59,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:13:59,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:13:59,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:13:59,721 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:13:59,722 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:13:59,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:13:59,722 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:13:59,722 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:13:59,722 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 02:13:59,723 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:13:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:59,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:13:59,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:13:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:13:59,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:13:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:13:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,816 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:13:59,816 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 02:13:59,817 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-06-22 02:13:59,817 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-06-22 02:13:59,919 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 70 states and 121 transitions. Complement of second has 10 states. [2020-06-22 02:13:59,920 INFO L142 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-06-22 02:13:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:13:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-06-22 02:13:59,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 02:13:59,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 02:13:59,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 02:13:59,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:13:59,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 121 transitions. [2020-06-22 02:13:59,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2020-06-22 02:13:59,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 48 states and 84 transitions. [2020-06-22 02:13:59,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-06-22 02:13:59,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 02:13:59,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 84 transitions. [2020-06-22 02:13:59,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:13:59,929 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 84 transitions. [2020-06-22 02:13:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 84 transitions. [2020-06-22 02:13:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 24. [2020-06-22 02:13:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 02:13:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2020-06-22 02:13:59,932 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. [2020-06-22 02:13:59,932 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. [2020-06-22 02:13:59,932 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:13:59,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 43 transitions. [2020-06-22 02:13:59,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 02:13:59,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:13:59,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:13:59,934 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:13:59,934 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:13:59,934 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 381#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 391#L20 [2020-06-22 02:13:59,934 INFO L796 eck$LassoCheckResult]: Loop: 391#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 394#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 393#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 391#L20 [2020-06-22 02:13:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2020-06-22 02:13:59,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash 68664, now seen corresponding path program 1 times [2020-06-22 02:13:59,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:13:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 58190905, now seen corresponding path program 2 times [2020-06-22 02:13:59,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:13:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:13:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:13:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:13:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:13:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:00,003 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:00,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:00,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:00,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:00,003 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:00,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:00,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:00,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:00,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:14:00,004 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:00,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:00,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:00,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:00,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:00,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:00,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:00,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:00,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:00,089 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} 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-06-22 02:14:00,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:00,095 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:00,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:00,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:00,399 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:00,402 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:00,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:00,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:00,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:00,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:00,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:00,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:00,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:00,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 02:14:00,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:00,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:00,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:00,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:00,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:00,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:00,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:00,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:00,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:00,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:00,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:00,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:00,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:00,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:00,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:00,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:00,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:00,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:00,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:00,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:00,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:00,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:00,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:00,469 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:00,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:00,473 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:14:00,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:00,474 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:14:00,474 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:00,474 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 02:14:00,474 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:14:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:14:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:00,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:14:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:00,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:14:00,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:00,581 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 02:14:00,582 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 5 loop predicates [2020-06-22 02:14:00,582 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21 Second operand 4 states. [2020-06-22 02:14:00,709 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 107 states and 184 transitions. Complement of second has 21 states. [2020-06-22 02:14:00,710 INFO L142 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-06-22 02:14:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:14:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2020-06-22 02:14:00,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 02:14:00,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:00,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 02:14:00,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:00,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 02:14:00,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:00,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 184 transitions. [2020-06-22 02:14:00,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-06-22 02:14:00,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 50 states and 82 transitions. [2020-06-22 02:14:00,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:14:00,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 02:14:00,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 82 transitions. [2020-06-22 02:14:00,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:14:00,719 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 82 transitions. [2020-06-22 02:14:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 82 transitions. [2020-06-22 02:14:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. [2020-06-22 02:14:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 02:14:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2020-06-22 02:14:00,723 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. [2020-06-22 02:14:00,723 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. [2020-06-22 02:14:00,723 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:14:00,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 46 transitions. [2020-06-22 02:14:00,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 02:14:00,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:00,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:00,724 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:14:00,724 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-06-22 02:14:00,725 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 578#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 579#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 595#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 596#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L20 [2020-06-22 02:14:00,725 INFO L796 eck$LassoCheckResult]: Loop: 591#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 585#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 586#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 593#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 600#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 594#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L20 [2020-06-22 02:14:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 58187991, now seen corresponding path program 1 times [2020-06-22 02:14:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1950482520, now seen corresponding path program 1 times [2020-06-22 02:14:00,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1858562222, now seen corresponding path program 1 times [2020-06-22 02:14:00,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:00,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:00,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:00,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:14:00,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:14:00,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:14:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:00,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:14:00,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:14:00,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:14:00,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-06-22 02:14:00,958 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:00,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:00,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:00,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:00,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:00,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:00,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:00,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:00,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:14:00,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:00,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:00,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:00,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:01,015 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:01,015 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:01,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:01,019 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:01,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:01,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:01,487 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:01,491 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:01,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:01,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:01,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:01,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:01,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:01,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:01,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:01,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 02:14:01,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:01,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:01,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:01,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:01,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:01,595 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:01,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:01,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:01,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:01,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:01,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:01,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:01,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:01,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:01,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:01,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:01,608 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 02:14:01,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:01,609 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:14:01,609 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:01,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 02:14:01,609 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:14:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:01,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:14:01,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:01,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:14:01,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:01,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:14:01,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:01,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:14:01,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:01,914 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:14:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:01,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:14:01,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:02,024 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 13 predicates after loop cannibalization [2020-06-22 02:14:02,025 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 13 loop predicates [2020-06-22 02:14:02,025 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23 Second operand 6 states. [2020-06-22 02:14:02,986 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23. Second operand 6 states. Result 504 states and 785 transitions. Complement of second has 156 states. [2020-06-22 02:14:02,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 02:14:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 02:14:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2020-06-22 02:14:02,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 02:14:02,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:02,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 02:14:02,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:02,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 02:14:02,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:02,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 785 transitions. [2020-06-22 02:14:03,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2020-06-22 02:14:03,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 67 states and 94 transitions. [2020-06-22 02:14:03,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 02:14:03,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 02:14:03,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 94 transitions. [2020-06-22 02:14:03,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:14:03,010 INFO L706 BuchiCegarLoop]: Abstraction has 67 states and 94 transitions. [2020-06-22 02:14:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 94 transitions. [2020-06-22 02:14:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 27. [2020-06-22 02:14:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 02:14:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-06-22 02:14:03,015 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-06-22 02:14:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:14:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:14:03,015 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 8 states. [2020-06-22 02:14:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:14:03,131 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2020-06-22 02:14:03,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 02:14:03,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 59 transitions. [2020-06-22 02:14:03,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-06-22 02:14:03,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 59 transitions. [2020-06-22 02:14:03,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 02:14:03,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 02:14:03,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 59 transitions. [2020-06-22 02:14:03,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:14:03,138 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-06-22 02:14:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 59 transitions. [2020-06-22 02:14:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2020-06-22 02:14:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 02:14:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-06-22 02:14:03,143 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-06-22 02:14:03,143 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-06-22 02:14:03,143 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:14:03,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-06-22 02:14:03,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-06-22 02:14:03,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:03,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:03,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:14:03,145 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2020-06-22 02:14:03,145 INFO L794 eck$LassoCheckResult]: Stem: 1525#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1518#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1520#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1530#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1537#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1533#L20 [2020-06-22 02:14:03,146 INFO L796 eck$LassoCheckResult]: Loop: 1533#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1534#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1535#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1536#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1530#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1537#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1533#L20 [2020-06-22 02:14:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash 58190874, now seen corresponding path program 1 times [2020-06-22 02:14:03,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:03,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:03,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2036369973, now seen corresponding path program 1 times [2020-06-22 02:14:03,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:03,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 817053582, now seen corresponding path program 1 times [2020-06-22 02:14:03,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:03,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,277 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:03,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:03,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:03,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:03,278 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:03,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:03,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:03,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:03,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:14:03,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:03,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:03,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:03,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:03,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:03,353 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:03,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:03,360 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:03,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:03,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:03,796 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:03,799 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:03,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:03,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:03,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:03,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:03,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:03,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:03,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:03,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 02:14:03,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:03,800 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:03,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:03,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:03,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:03,865 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:03,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:03,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:03,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:03,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:03,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:03,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:03,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:03,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:03,873 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:03,875 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:03,875 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:14:03,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:03,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:14:03,876 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:03,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 02:14:03,876 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:14:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:03,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:14:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:03,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 02:14:03,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,951 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:14:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,958 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:14:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:03,964 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 02:14:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:03,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 02:14:03,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:04,037 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 02:14:04,037 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-06-22 02:14:04,038 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-06-22 02:14:04,294 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 87 states and 131 transitions. Complement of second has 22 states. [2020-06-22 02:14:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 02:14:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 02:14:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2020-06-22 02:14:04,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 02:14:04,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:04,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2020-06-22 02:14:04,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:04,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2020-06-22 02:14:04,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:04,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 131 transitions. [2020-06-22 02:14:04,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:14:04,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 56 states and 84 transitions. [2020-06-22 02:14:04,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 02:14:04,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 02:14:04,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 84 transitions. [2020-06-22 02:14:04,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:14:04,301 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2020-06-22 02:14:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 84 transitions. [2020-06-22 02:14:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2020-06-22 02:14:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 02:14:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2020-06-22 02:14:04,305 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 63 transitions. [2020-06-22 02:14:04,305 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 63 transitions. [2020-06-22 02:14:04,305 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:14:04,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 63 transitions. [2020-06-22 02:14:04,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:14:04,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:14:04,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:14:04,307 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-06-22 02:14:04,307 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:14:04,307 INFO L794 eck$LassoCheckResult]: Stem: 1748#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~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_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1741#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1744#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1760#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1759#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1756#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1749#L20-2 [2020-06-22 02:14:04,307 INFO L796 eck$LassoCheckResult]: Loop: 1749#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1750#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1755#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1749#L20-2 [2020-06-22 02:14:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1803827760, now seen corresponding path program 1 times [2020-06-22 02:14:04,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:04,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:04,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 63431, now seen corresponding path program 3 times [2020-06-22 02:14:04,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:14:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash -797975752, now seen corresponding path program 2 times [2020-06-22 02:14:04,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:14:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:14:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:14:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:14:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:14:04,381 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:04,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:04,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:04,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:04,382 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:14:04,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:04,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:04,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:04,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 02:14:04,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:04,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:04,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:04,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:04,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:04,445 INFO L412 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-06-22 02:14:04,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:04,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:04,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:14:04,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/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-06-22 02:14:04,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:14:04,484 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:14:04,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:14:04,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:14:08,784 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:14:08,787 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:14:08,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:14:08,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:14:08,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:14:08,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:14:08,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:14:08,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:14:08,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:14:08,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 02:14:08,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:14:08,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:14:08,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:08,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:14:08,867 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:14:08,868 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:14:08,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:08,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:08,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:08,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:08,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:08,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:08,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:08,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:08,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:14:08,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:14:08,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:14:08,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:14:08,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:14:08,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:14:08,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:14:08,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:14:08,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:14:08,883 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:14:08,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:14:08,886 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:14:08,886 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:14:08,886 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:14:08,886 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:14:08,886 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-06-22 02:14:08,887 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:14:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:14:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:08,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:14:08,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:14:08,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:14:08,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:14:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:14:08,943 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 02:14:08,943 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 02:14:08,944 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. [2020-06-22 02:14:09,004 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 61 states and 97 transitions. Complement of second has 7 states. [2020-06-22 02:14:09,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 02:14:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:14:09,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-06-22 02:14:09,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 02:14:09,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:09,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 02:14:09,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:09,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 02:14:09,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:14:09,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 97 transitions. [2020-06-22 02:14:09,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:14:09,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2020-06-22 02:14:09,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:14:09,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:14:09,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:14:09,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:14:09,009 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:09,010 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:09,010 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:14:09,010 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 02:14:09,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:14:09,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:14:09,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:14:09,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:14:09 BasicIcfg [2020-06-22 02:14:09,018 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:14:09,018 INFO L168 Benchmark]: Toolchain (without parser) took 12643.36 ms. Allocated memory was 649.6 MB in the beginning and 771.2 MB in the end (delta: 121.6 MB). Free memory was 564.3 MB in the beginning and 466.5 MB in the end (delta: 97.8 MB). Peak memory consumption was 219.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,020 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:14:09,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.53 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 564.3 MB in the beginning and 655.5 MB in the end (delta: -91.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 687.9 MB. Free memory was 655.5 MB in the beginning and 654.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,021 INFO L168 Benchmark]: Boogie Preprocessor took 19.61 ms. Allocated memory is still 687.9 MB. Free memory was 654.1 MB in the beginning and 651.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,022 INFO L168 Benchmark]: RCFGBuilder took 250.61 ms. Allocated memory is still 687.9 MB. Free memory was 651.0 MB in the beginning and 637.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,023 INFO L168 Benchmark]: BlockEncodingV2 took 85.03 ms. Allocated memory is still 687.9 MB. Free memory was 637.0 MB in the beginning and 631.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,023 INFO L168 Benchmark]: TraceAbstraction took 184.69 ms. Allocated memory is still 687.9 MB. Free memory was 631.6 MB in the beginning and 622.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,023 INFO L168 Benchmark]: BuchiAutomizer took 11712.14 ms. Allocated memory was 687.9 MB in the beginning and 771.2 MB in the end (delta: 83.4 MB). Free memory was 622.1 MB in the beginning and 466.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 239.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:14:09,028 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 10 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.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 343.53 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 564.3 MB in the beginning and 655.5 MB in the end (delta: -91.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 687.9 MB. Free memory was 655.5 MB in the beginning and 654.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.61 ms. Allocated memory is still 687.9 MB. Free memory was 654.1 MB in the beginning and 651.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 250.61 ms. Allocated memory is still 687.9 MB. Free memory was 651.0 MB in the beginning and 637.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 85.03 ms. Allocated memory is still 687.9 MB. Free memory was 637.0 MB in the beginning and 631.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 184.69 ms. Allocated memory is still 687.9 MB. Free memory was 631.6 MB in the beginning and 622.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 11712.14 ms. Allocated memory was 687.9 MB in the beginning and 771.2 MB in the end (delta: 83.4 MB). Free memory was 622.1 MB in the beginning and 466.5 MB in the end (delta: 155.6 MB). Peak memory consumption was 239.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: 19]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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 9 terminating modules (2 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 21 locations. One nondeterministic module has affine ranking function x and consists of 11 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.4s. Construction of modules took 0.5s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 140 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 36 SDtfs, 148 SDslu, 4 SDs, 0 SdLazy, 536 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp88 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq178 hnf92 smp100 dnf100 smp100 tf105 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:13:53.003 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:14:09.276 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check