YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:49:26,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:49:26,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:49:26,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:49:26,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:49:26,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:49:26,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:49:27,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:49:27,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:49:27,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:49:27,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:49:27,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:49:27,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:49:27,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:49:27,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:49:27,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:49:27,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:49:27,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:49:27,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:49:27,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:49:27,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:49:27,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:49:27,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:49:27,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:49:27,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:49:27,018 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:49:27,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:49:27,019 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:49:27,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:49:27,020 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:49:27,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:49:27,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:49:27,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:49:27,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:49:27,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:49:27,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:49:27,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:49:27,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:49:27,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:49:27,025 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 08:49:27,039 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:49:27,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:49:27,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:49:27,040 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:49:27,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:49:27,041 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:49:27,041 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:49:27,041 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:49:27,041 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:49:27,041 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:27,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:49:27,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:49:27,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:49:27,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:49:27,043 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:49:27,043 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:49:27,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:49:27,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:49:27,044 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:49:27,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:49:27,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:49:27,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:49:27,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:49:27,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:49:27,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:49:27,082 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:49:27,085 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:49:27,087 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:49:27,087 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:49:27,088 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:49:27,166 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/df3ce225220942eca019896b6d281762/FLAGff3c4040c [2020-06-22 08:49:27,497 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:49:27,498 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:49:27,506 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/df3ce225220942eca019896b6d281762/FLAGff3c4040c [2020-06-22 08:49:27,915 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/df3ce225220942eca019896b6d281762 [2020-06-22 08:49:27,926 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:49:27,928 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:49:27,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:49:27,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:49:27,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:49:27,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:49:27" (1/1) ... [2020-06-22 08:49:27,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ca8faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:27, skipping insertion in model container [2020-06-22 08:49:27,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:49:27" (1/1) ... [2020-06-22 08:49:27,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:49:27,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:49:28,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:49:28,123 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:49:28,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:49:28,212 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:49:28,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28 WrapperNode [2020-06-22 08:49:28,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:49:28,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:49:28,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:49:28,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:49:28,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:49:28,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:49:28,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:49:28,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:49:28,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:49:28,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:49:28,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:49:28,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:49:28,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:49:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:49:28,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:49:28,515 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:49:28,515 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 08:49:28,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:28 BoogieIcfgContainer [2020-06-22 08:49:28,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:49:28,517 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:49:28,517 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:49:28,520 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:49:28,520 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:28" (1/1) ... [2020-06-22 08:49:28,536 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges [2020-06-22 08:49:28,538 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:49:28,539 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:49:28,539 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:49:28,540 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:49:28,541 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:49:28,543 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:49:28,543 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:49:28,561 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:49:28,581 INFO L200 BlockEncoder]: SBE split 6 edges [2020-06-22 08:49:28,587 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:49:28,589 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:49:28,601 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 08:49:28,603 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 08:49:28,605 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:49:28,605 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:49:28,605 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:49:28,606 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:49:28,606 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 16 edges [2020-06-22 08:49:28,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:28 BasicIcfg [2020-06-22 08:49:28,607 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:49:28,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:49:28,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:49:28,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:49:28,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:49:27" (1/4) ... [2020-06-22 08:49:28,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5866744d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (2/4) ... [2020-06-22 08:49:28,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5866744d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:28" (3/4) ... [2020-06-22 08:49:28,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5866744d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:28" (4/4) ... [2020-06-22 08:49:28,616 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:49:28,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:49:28,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 08:49:28,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 08:49:28,686 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:49:28,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:49:28,687 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:49:28,687 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:49:28,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:49:28,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:49:28,688 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:49:28,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:49:28,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:49:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 08:49:28,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:49:28,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 08:49:28,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:49:28,760 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2020-06-22 08:49:28,760 INFO L451 ceAbstractionStarter]: At program point L28-2(lines 19 31) the Hoare annotation is: true [2020-06-22 08:49:28,761 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2020-06-22 08:49:28,761 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 25) no Hoare annotation was computed. [2020-06-22 08:49:28,761 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 30) no Hoare annotation was computed. [2020-06-22 08:49:28,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:28 BasicIcfg [2020-06-22 08:49:28,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:49:28,770 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:49:28,770 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:49:28,773 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:49:28,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:28,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:49:27" (1/5) ... [2020-06-22 08:49:28,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e482a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:28,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:49:28" (2/5) ... [2020-06-22 08:49:28,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e482a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:28,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:49:28" (3/5) ... [2020-06-22 08:49:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e482a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,776 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:28,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:49:28" (4/5) ... [2020-06-22 08:49:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e482a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:28, skipping insertion in model container [2020-06-22 08:49:28,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:28,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:28" (5/5) ... [2020-06-22 08:49:28,778 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:49:28,805 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:49:28,806 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:49:28,806 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:49:28,806 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:49:28,806 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:49:28,806 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:49:28,806 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:49:28,806 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:49:28,807 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:49:28,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 08:49:28,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:49:28,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:28,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:28,835 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 08:49:28,835 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 08:49:28,836 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:49:28,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 08:49:28,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:49:28,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:28,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:28,837 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 08:49:28,837 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 08:49:28,842 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 3#L28-2true [2020-06-22 08:49:28,843 INFO L796 eck$LassoCheckResult]: Loop: 3#L28-2true [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 8#L20true [66] L20-->L26: Formula: (> v_ULTIMATE.start_main_~j~0_11 v_ULTIMATE.start_main_~bn~0_9) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} AuxVars[] AssignedVars[] 4#L26true [43] L26-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~an~0_10) (<= v_ULTIMATE.start_main_~bn~0_10 v_ULTIMATE.start_main_~j~0_12) (= v_ULTIMATE.start_main_~i~0_12 (+ v_ULTIMATE.start_main_~i~0_13 1))) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 3#L28-2true [2020-06-22 08:49:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2020-06-22 08:49:28,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 89540, now seen corresponding path program 1 times [2020-06-22 08:49:28,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:28,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2383447, now seen corresponding path program 1 times [2020-06-22 08:49:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:28,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:28,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,003 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:29,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:29,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:29,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:29,004 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 08:49:29,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:29,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:29,005 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 08:49:29,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:29,006 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:29,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:29,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:29,051 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 08:49:29,059 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 08:49:29,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:29,133 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:29,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:29,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 08:49:29,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:29,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:29,207 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 08:49:29,208 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:29,213 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 08:49:29,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:29,395 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 08:49:29,397 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:29,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:29,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:29,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:29,398 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:29,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:29,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:29,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:29,399 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 08:49:29,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:29,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:29,402 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 08:49:29,409 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 08:49:29,413 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 08:49:29,417 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 08:49:29,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:29,490 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:29,492 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 08:49:29,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:29,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:29,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:29,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:29,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:29,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:29,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:29,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:29,512 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:49:29,512 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:49:29,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:29,514 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:49:29,515 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:29,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~an~0 - 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2020-06-22 08:49:29,517 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 08:49:29,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:29,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:29,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:29,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:29,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:29,597 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 08:49:29,629 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 08:49:29,634 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 2 loop predicates [2020-06-22 08:49:29,635 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 3 states. [2020-06-22 08:49:29,740 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 3 states. Result 28 states and 82 transitions. Complement of second has 7 states. [2020-06-22 08:49:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 08:49:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-06-22 08:49:29,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 08:49:29,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 08:49:29,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 08:49:29,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:29,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 82 transitions. [2020-06-22 08:49:29,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:29,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 65 transitions. [2020-06-22 08:49:29,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 08:49:29,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 08:49:29,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 65 transitions. [2020-06-22 08:49:29,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:29,765 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 65 transitions. [2020-06-22 08:49:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 65 transitions. [2020-06-22 08:49:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-06-22 08:49:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:49:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2020-06-22 08:49:29,797 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 60 transitions. [2020-06-22 08:49:29,797 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 60 transitions. [2020-06-22 08:49:29,797 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:49:29,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 60 transitions. [2020-06-22 08:49:29,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:29,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:29,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:29,799 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:49:29,799 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 08:49:29,799 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 88#L28-2 [62] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 75#L20 [2020-06-22 08:49:29,800 INFO L796 eck$LassoCheckResult]: Loop: 75#L20 [53] L20-->L21: Formula: (and (<= v_ULTIMATE.start_main_~i~0_8 v_ULTIMATE.start_main_~an~0_8) (<= v_ULTIMATE.start_main_~j~0_8 v_ULTIMATE.start_main_~bn~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[] 84#L21 [68] L21-->L28-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_9 (+ v_ULTIMATE.start_main_~j~0_10 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 85#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 75#L20 [2020-06-22 08:49:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2480, now seen corresponding path program 1 times [2020-06-22 08:49:29,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 82892, now seen corresponding path program 1 times [2020-06-22 08:49:29,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:29,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash 73934781, now seen corresponding path program 1 times [2020-06-22 08:49:29,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:29,853 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:29,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:29,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:29,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:29,854 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 08:49:29,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:29,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:29,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 08:49:29,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:29,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:29,856 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 08:49:29,860 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 08:49:29,868 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 08:49:29,871 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 08:49:29,873 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 08:49:29,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:29,930 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:29,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:29,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 08:49:29,964 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:29,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:29,969 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:30,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 08:49:30,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:30,375 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 08:49:30,378 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:30,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:30,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:30,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:30,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:30,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:30,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:30,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:30,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 08:49:30,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:30,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:30,382 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 08:49:30,396 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 08:49:30,402 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 08:49:30,406 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 08:49:30,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 08:49:30,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:30,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:30,470 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 08:49:30,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:30,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:30,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:30,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:30,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:30,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:30,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:30,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:30,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:49:30,482 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:49:30,483 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:30,483 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:49:30,483 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:30,483 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~bn~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-06-22 08:49:30,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 08:49:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:30,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:30,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:30,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:30,555 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 08:49:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:30,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:30,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:30,581 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:30,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 3 loop predicates [2020-06-22 08:49:30,582 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 60 transitions. cyclomatic complexity: 42 Second operand 4 states. [2020-06-22 08:49:30,714 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 60 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 161 states and 420 transitions. Complement of second has 19 states. [2020-06-22 08:49:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 08:49:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:49:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-06-22 08:49:30,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 08:49:30,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:30,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 08:49:30,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:30,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 59 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 08:49:30,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:30,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 420 transitions. [2020-06-22 08:49:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:30,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 21 states and 52 transitions. [2020-06-22 08:49:30,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 08:49:30,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 08:49:30,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 52 transitions. [2020-06-22 08:49:30,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:30,730 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. [2020-06-22 08:49:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 52 transitions. [2020-06-22 08:49:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 08:49:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:49:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2020-06-22 08:49:30,733 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. [2020-06-22 08:49:30,733 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 52 transitions. [2020-06-22 08:49:30,733 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:49:30,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 52 transitions. [2020-06-22 08:49:30,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:30,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:30,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:30,735 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:49:30,735 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 08:49:30,735 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 331#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 320#L20 [2020-06-22 08:49:30,736 INFO L796 eck$LassoCheckResult]: Loop: 320#L20 [53] L20-->L21: Formula: (and (<= v_ULTIMATE.start_main_~i~0_8 v_ULTIMATE.start_main_~an~0_8) (<= v_ULTIMATE.start_main_~j~0_8 v_ULTIMATE.start_main_~bn~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[] 328#L21 [68] L21-->L28-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_9 (+ v_ULTIMATE.start_main_~j~0_10 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 319#L28-2 [60] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_7 v_ULTIMATE.start_main_~j~0_7) (<= v_ULTIMATE.start_main_~i~0_7 v_ULTIMATE.start_main_~an~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 320#L20 [2020-06-22 08:49:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2478, now seen corresponding path program 1 times [2020-06-22 08:49:30,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:30,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:30,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 82892, now seen corresponding path program 2 times [2020-06-22 08:49:30,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 73875199, now seen corresponding path program 1 times [2020-06-22 08:49:30,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:30,789 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:30,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:30,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:30,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:30,789 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 08:49:30,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:30,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:30,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:30,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 08:49:30,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:30,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:30,791 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 08:49:30,797 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 08:49:30,804 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 08:49:30,807 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 08:49:30,810 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 08:49:30,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:30,863 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:30,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:30,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:30,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 08:49:30,895 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:30,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:30,900 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:30,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 08:49:30,932 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:31,231 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 08:49:31,234 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:31,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:31,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:31,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:31,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:31,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:31,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:31,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:31,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 08:49:31,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:31,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:31,249 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 08:49:31,253 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 08:49:31,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:31,263 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 08:49:31,266 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 08:49:31,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:31,312 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:31,312 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 08:49:31,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:31,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:31,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:31,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:31,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:31,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:31,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:31,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:31,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:31,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:31,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:31,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:31,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:31,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:31,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:31,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:31,323 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:31,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 08:49:31,327 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 08:49:31,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:31,328 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:49:31,328 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:31,328 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~bn~0 + 1 Supporting invariants [] [2020-06-22 08:49:31,328 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 08:49:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,406 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 08:49:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:31,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:31,442 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 08:49:31,442 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 08:49:31,443 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 52 transitions. cyclomatic complexity: 34 Second operand 4 states. [2020-06-22 08:49:31,513 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 52 transitions. cyclomatic complexity: 34. Second operand 4 states. Result 157 states and 371 transitions. Complement of second has 21 states. [2020-06-22 08:49:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:49:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-06-22 08:49:31,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 08:49:31,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 08:49:31,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 08:49:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:31,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 371 transitions. [2020-06-22 08:49:31,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:31,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 21 states and 44 transitions. [2020-06-22 08:49:31,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 08:49:31,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 08:49:31,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 44 transitions. [2020-06-22 08:49:31,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:31,525 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. [2020-06-22 08:49:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 44 transitions. [2020-06-22 08:49:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 08:49:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:49:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 44 transitions. [2020-06-22 08:49:31,528 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. [2020-06-22 08:49:31,528 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 44 transitions. [2020-06-22 08:49:31,528 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:49:31,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 44 transitions. [2020-06-22 08:49:31,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:49:31,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:31,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:31,529 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:49:31,529 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:31,529 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 570#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 575#L20 [2020-06-22 08:49:31,530 INFO L796 eck$LassoCheckResult]: Loop: 575#L20 [66] L20-->L26: Formula: (> v_ULTIMATE.start_main_~j~0_11 v_ULTIMATE.start_main_~bn~0_9) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_9} AuxVars[] AssignedVars[] 576#L26 [70] L26-->L28: Formula: (> v_ULTIMATE.start_main_~bn~0_11 v_ULTIMATE.start_main_~j~0_13) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} AuxVars[] AssignedVars[] 578#L28 [50] L28-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~j~0_15 v_ULTIMATE.start_main_~bn~0_12) (= v_ULTIMATE.start_main_~j~0_14 (+ v_ULTIMATE.start_main_~j~0_15 1)) (<= v_ULTIMATE.start_main_~an~0_12 v_ULTIMATE.start_main_~i~0_15)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 577#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 575#L20 [2020-06-22 08:49:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2479, now seen corresponding path program 1 times [2020-06-22 08:49:31,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2958608, now seen corresponding path program 1 times [2020-06-22 08:49:31,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:31,572 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 08:49:31,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:31,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:31,577 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:31,581 INFO L87 Difference]: Start difference. First operand 21 states and 44 transitions. cyclomatic complexity: 26 Second operand 3 states. [2020-06-22 08:49:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:31,610 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-06-22 08:49:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:31,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2020-06-22 08:49:31,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 08:49:31,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 17 states and 29 transitions. [2020-06-22 08:49:31,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 08:49:31,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 08:49:31,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 29 transitions. [2020-06-22 08:49:31,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:49:31,614 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 08:49:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 29 transitions. [2020-06-22 08:49:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:49:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:49:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2020-06-22 08:49:31,616 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 08:49:31,616 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-22 08:49:31,616 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:49:31,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. [2020-06-22 08:49:31,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 08:49:31,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:31,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:31,617 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 08:49:31,617 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:49:31,617 INFO L794 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_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~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 625#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 628#L20 [2020-06-22 08:49:31,617 INFO L796 eck$LassoCheckResult]: Loop: 628#L20 [67] L20-->L26: Formula: (> v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_9) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 617#L26 [70] L26-->L28: Formula: (> v_ULTIMATE.start_main_~bn~0_11 v_ULTIMATE.start_main_~j~0_13) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_11} AuxVars[] AssignedVars[] 618#L28 [50] L28-->L28-2: Formula: (and (<= v_ULTIMATE.start_main_~j~0_15 v_ULTIMATE.start_main_~bn~0_12) (= v_ULTIMATE.start_main_~j~0_14 (+ v_ULTIMATE.start_main_~j~0_15 1)) (<= v_ULTIMATE.start_main_~an~0_12 v_ULTIMATE.start_main_~i~0_15)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_15, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_14, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 626#L28-2 [61] L28-2-->L20: Formula: (and (<= v_ULTIMATE.start_main_~an~0_7 v_ULTIMATE.start_main_~i~0_7) (<= v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~bn~0_7)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 628#L20 [2020-06-22 08:49:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2479, now seen corresponding path program 2 times [2020-06-22 08:49:31,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2988399, now seen corresponding path program 1 times [2020-06-22 08:49:31,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2003493859, now seen corresponding path program 1 times [2020-06-22 08:49:31,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:31,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:31,663 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:31,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:31,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:31,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:31,663 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 08:49:31,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:31,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:31,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:31,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 08:49:31,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:31,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:31,665 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 08:49:31,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 08:49:31,673 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 08:49:31,676 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 08:49:31,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:31,710 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:31,714 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:31,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:31,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 08:49:31,741 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:31,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 08:49:31,745 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:49:31,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 08:49:31,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 08:49:32,240 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 08:49:32,242 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:32,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:32,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:32,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:32,243 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:32,243 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:32,243 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:32,243 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:32,243 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 08:49:32,243 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:32,243 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:32,245 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 08:49:32,250 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 08:49:32,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:32,254 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 08:49:32,286 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:32,287 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:32,287 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 08:49:32,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:32,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:32,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:32,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:32,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:32,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:32,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:32,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:32,297 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:49:32,297 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 08:49:32,297 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:32,298 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 08:49:32,298 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:32,298 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~bn~0 Supporting invariants [] [2020-06-22 08:49:32,298 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 08:49:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,329 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 08:49:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:32,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:49:32,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:32,394 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 08:49:32,394 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 08:49:32,394 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-06-22 08:49:32,445 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 41 states and 71 transitions. Complement of second has 8 states. [2020-06-22 08:49:32,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-06-22 08:49:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:49:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 08:49:32,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 08:49:32,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 08:49:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 08:49:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:32,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 71 transitions. [2020-06-22 08:49:32,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:32,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 08:49:32,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:49:32,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:49:32,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:49:32,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:32,450 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:32,450 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:32,450 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:32,450 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:49:32,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:49:32,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:32,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:49:32,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:32 BasicIcfg [2020-06-22 08:49:32,457 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:49:32,457 INFO L168 Benchmark]: Toolchain (without parser) took 4530.50 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 565.3 MB in the beginning and 601.8 MB in the end (delta: -36.5 MB). Peak memory consumption was 64.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,459 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:49:32,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 565.3 MB in the beginning and 643.7 MB in the end (delta: -78.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 678.4 MB. Free memory was 643.7 MB in the beginning and 642.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,461 INFO L168 Benchmark]: Boogie Preprocessor took 20.70 ms. Allocated memory is still 678.4 MB. Free memory was 642.2 MB in the beginning and 639.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,461 INFO L168 Benchmark]: RCFGBuilder took 244.71 ms. Allocated memory is still 678.4 MB. Free memory was 639.1 MB in the beginning and 623.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,462 INFO L168 Benchmark]: BlockEncodingV2 took 89.64 ms. Allocated memory is still 678.4 MB. Free memory was 623.8 MB in the beginning and 618.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,462 INFO L168 Benchmark]: TraceAbstraction took 161.63 ms. Allocated memory is still 678.4 MB. Free memory was 617.0 MB in the beginning and 608.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,463 INFO L168 Benchmark]: BuchiAutomizer took 3687.34 ms. Allocated memory was 678.4 MB in the beginning and 750.8 MB in the end (delta: 72.4 MB). Free memory was 608.8 MB in the beginning and 601.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 79.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:32,467 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 15 edges - StatisticsResult: Encoded RCFG 6 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 283.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 565.3 MB in the beginning and 643.7 MB in the end (delta: -78.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 678.4 MB. Free memory was 643.7 MB in the beginning and 642.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.70 ms. Allocated memory is still 678.4 MB. Free memory was 642.2 MB in the beginning and 639.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 244.71 ms. Allocated memory is still 678.4 MB. Free memory was 639.1 MB in the beginning and 623.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 89.64 ms. Allocated memory is still 678.4 MB. Free memory was 623.8 MB in the beginning and 618.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 161.63 ms. Allocated memory is still 678.4 MB. Free memory was 617.0 MB in the beginning and 608.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3687.34 ms. Allocated memory was 678.4 MB in the beginning and 750.8 MB in the end (delta: 72.4 MB). Free memory was 608.8 MB in the beginning and 601.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 79.4 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, 6 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred 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 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function 2 * an + -2 * i + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * bn + -2 * j + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * j + 2 * bn + 1 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + bn and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 148 SDslu, 28 SDs, 0 SdLazy, 211 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax177 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:49:24.746 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:49:32.698 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check