YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 07:25:23,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 07:25:23,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 07:25:23,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 07:25:23,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 07:25:23,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 07:25:23,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 07:25:23,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 07:25:23,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 07:25:23,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 07:25:23,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 07:25:23,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 07:25:23,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 07:25:23,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 07:25:23,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 07:25:23,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 07:25:23,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 07:25:23,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 07:25:23,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 07:25:23,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 07:25:23,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 07:25:23,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 07:25:23,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 07:25:23,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 07:25:23,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 07:25:23,948 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 07:25:23,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 07:25:23,949 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 07:25:23,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 07:25:23,950 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 07:25:23,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 07:25:23,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 07:25:23,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 07:25:23,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 07:25:23,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 07:25:23,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 07:25:23,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 07:25:23,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 07:25:23,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 07:25:23,955 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 07:25:23,969 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 07:25:23,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 07:25:23,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 07:25:23,971 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 07:25:23,971 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 07:25:23,972 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 07:25:23,972 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 07:25:23,972 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 07:25:23,972 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 07:25:23,972 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:23,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 07:25:23,973 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 07:25:23,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 07:25:23,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 07:25:23,973 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 07:25:23,973 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 07:25:23,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 07:25:23,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 07:25:23,974 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 07:25:23,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 07:25:23,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 07:25:23,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 07:25:23,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 07:25:23,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 07:25:24,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 07:25:24,013 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 07:25:24,016 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 07:25:24,018 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 07:25:24,018 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 07:25:24,019 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 07:25:24,085 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/2ce0eb53f9934c828e72dfee1202b68f/FLAG5177dfc4c [2020-06-22 07:25:24,421 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 07:25:24,422 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 07:25:24,428 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/2ce0eb53f9934c828e72dfee1202b68f/FLAG5177dfc4c [2020-06-22 07:25:24,817 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/2ce0eb53f9934c828e72dfee1202b68f [2020-06-22 07:25:24,828 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 07:25:24,830 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 07:25:24,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 07:25:24,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 07:25:24,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 07:25:24,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 07:25:24" (1/1) ... [2020-06-22 07:25:24,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0f2008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:24, skipping insertion in model container [2020-06-22 07:25:24,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 07:25:24" (1/1) ... [2020-06-22 07:25:24,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 07:25:24,864 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 07:25:25,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 07:25:25,026 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 07:25:25,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 07:25:25,126 INFO L195 MainTranslator]: Completed translation [2020-06-22 07:25:25,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25 WrapperNode [2020-06-22 07:25:25,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 07:25:25,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 07:25:25,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 07:25:25,128 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 07:25:25,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 07:25:25,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 07:25:25,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 07:25:25,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 07:25:25,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 07:25:25,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 07:25:25,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 07:25:25,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 07:25:25,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (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 07:25:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 07:25:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 07:25:25,411 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 07:25:25,412 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 07:25:25,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:25:25 BoogieIcfgContainer [2020-06-22 07:25:25,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 07:25:25,414 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 07:25:25,414 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 07:25:25,416 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 07:25:25,417 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:25:25" (1/1) ... [2020-06-22 07:25:25,433 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 16 edges [2020-06-22 07:25:25,435 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 07:25:25,436 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 07:25:25,436 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 07:25:25,437 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 07:25:25,439 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 07:25:25,440 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 07:25:25,440 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 07:25:25,457 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 07:25:25,473 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 07:25:25,478 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 07:25:25,480 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 07:25:25,492 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 07:25:25,495 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 07:25:25,496 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 07:25:25,496 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 07:25:25,496 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 07:25:25,497 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 07:25:25,497 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 9 edges [2020-06-22 07:25:25,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:25:25 BasicIcfg [2020-06-22 07:25:25,498 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 07:25:25,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 07:25:25,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 07:25:25,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 07:25:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 07:25:24" (1/4) ... [2020-06-22 07:25:25,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f48d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (2/4) ... [2020-06-22 07:25:25,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f48d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:25:25" (3/4) ... [2020-06-22 07:25:25,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f48d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:25:25" (4/4) ... [2020-06-22 07:25:25,506 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 07:25:25,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 07:25:25,524 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 07:25:25,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 07:25:25,573 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 07:25:25,574 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 07:25:25,574 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 07:25:25,574 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 07:25:25,574 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 07:25:25,574 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 07:25:25,574 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 07:25:25,575 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 07:25:25,575 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 07:25:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-06-22 07:25:25,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 07:25:25,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-06-22 07:25:25,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 07:25:25,647 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 4 20) no Hoare annotation was computed. [2020-06-22 07:25:25,647 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 12) no Hoare annotation was computed. [2020-06-22 07:25:25,647 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 4 20) no Hoare annotation was computed. [2020-06-22 07:25:25,648 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-06-22 07:25:25,648 INFO L451 ceAbstractionStarter]: At program point L4-2(lines 4 20) the Hoare annotation is: true [2020-06-22 07:25:25,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:25:25 BasicIcfg [2020-06-22 07:25:25,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 07:25:25,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 07:25:25,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 07:25:25,660 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 07:25:25,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:25:25,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 07:25:24" (1/5) ... [2020-06-22 07:25:25,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46a8cb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:25:25,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:25:25" (2/5) ... [2020-06-22 07:25:25,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46a8cb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:25:25,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:25:25" (3/5) ... [2020-06-22 07:25:25,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46a8cb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,664 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:25:25,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:25:25" (4/5) ... [2020-06-22 07:25:25,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46a8cb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:25:25, skipping insertion in model container [2020-06-22 07:25:25,664 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:25:25,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:25:25" (5/5) ... [2020-06-22 07:25:25,666 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 07:25:25,693 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 07:25:25,693 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 07:25:25,693 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 07:25:25,693 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 07:25:25,693 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 07:25:25,693 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 07:25:25,693 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 07:25:25,694 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 07:25:25,694 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 07:25:25,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 07:25:25,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:25,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:25:25,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:25:25,720 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 07:25:25,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:25,720 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 07:25:25,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-06-22 07:25:25,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:25,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:25:25,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:25:25,722 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 07:25:25,722 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:25,727 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 7#L4-2true [2020-06-22 07:25:25,728 INFO L796 eck$LassoCheckResult]: Loop: 7#L4-2true [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3#L5true [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 8#L9true [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 6#L9-2true [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 5#L13-1true [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 7#L4-2true [2020-06-22 07:25:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 76, now seen corresponding path program 1 times [2020-06-22 07:25:25,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:25,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:25,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 79477241, now seen corresponding path program 1 times [2020-06-22 07:25:25,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:25,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,810 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:25,810 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:25,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:25,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2068303730, now seen corresponding path program 1 times [2020-06-22 07:25:25,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:25,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:25,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:25,889 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:25,890 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:25,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:25,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:25,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:25,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:25,973 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 07:25:26,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:25:26,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 07:25:27,569 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 30 [2020-06-22 07:25:28,665 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 07:25:28,677 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:28,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:28,679 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:28,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:28,679 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:25:28,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:28,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:28,679 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:28,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 07:25:28,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:28,680 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:28,695 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 07:25:28,702 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 07:25:28,705 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 07:25:28,752 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 07:25:29,312 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-06-22 07:25:29,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:29,378 INFO L412 LassoAnalysis]: Checking for nontermination... 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 07:25:29,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:29,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:29,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:25:29,391 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post2=0} Honda state: {ULTIMATE.start_fermat_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 07:25:29,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:29,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:29,421 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:25:29,421 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post1=0} Honda state: {ULTIMATE.start_fermat_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 07:25:29,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:29,448 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 07:25:29,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:25:29,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:29,491 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:25:29,516 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:29,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:29,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:29,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:29,516 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:25:29,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:25:29,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:29,517 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:29,517 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 07:25:29,517 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:29,517 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:29,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 07:25:29,521 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 07:25:29,524 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 07:25:30,983 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 07:25:30,983 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 07:25:31,590 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-06-22 07:25:31,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:31,599 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:25:31,601 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 07:25:31,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:31,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:31,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:31,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:31,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:31,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:31,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:31,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:25:31,611 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 07:25:31,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:31,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:31,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:31,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:31,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:31,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:31,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:31,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:25:31,615 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 07:25:31,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:31,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:31,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:31,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:31,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:31,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:31,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:31,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:25:31,649 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 07:25:31,649 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 07:25:31,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:25:31,651 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:25:31,651 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:25:31,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~c~0) = 1*ULTIMATE.start_fermat_~MAX~0 - 1*ULTIMATE.start_fermat_~c~0 Supporting invariants [] [2020-06-22 07:25:31,653 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:25:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:31,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 07:25:31,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:31,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:31,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:31,698 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 07:25:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:31,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:31,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:31,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:31,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:31,806 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 07:25:31,811 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 07:25:31,813 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states. Second operand 4 states. [2020-06-22 07:25:31,885 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states.. Second operand 4 states. Result 15 states and 23 transitions. Complement of second has 5 states. [2020-06-22 07:25:31,886 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 07:25:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 07:25:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-06-22 07:25:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 5 letters. [2020-06-22 07:25:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 5 letters. [2020-06-22 07:25:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 10 letters. [2020-06-22 07:25:31,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:31,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2020-06-22 07:25:31,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:31,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 23 transitions. [2020-06-22 07:25:31,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 07:25:31,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 07:25:31,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2020-06-22 07:25:31,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:25:31,912 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2020-06-22 07:25:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2020-06-22 07:25:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 07:25:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 07:25:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-06-22 07:25:31,945 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-06-22 07:25:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 07:25:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 07:25:31,949 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 4 states. [2020-06-22 07:25:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:25:31,992 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2020-06-22 07:25:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 07:25:31,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 39 transitions. [2020-06-22 07:25:31,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:31,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 39 transitions. [2020-06-22 07:25:31,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 07:25:31,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 07:25:31,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2020-06-22 07:25:31,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:25:31,999 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2020-06-22 07:25:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2020-06-22 07:25:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2020-06-22 07:25:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 07:25:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-06-22 07:25:32,001 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 07:25:32,001 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 07:25:32,001 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 07:25:32,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-06-22 07:25:32,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:32,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:25:32,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:25:32,003 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 07:25:32,003 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:32,003 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 166#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 177#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 174#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 171#L9-2 [2020-06-22 07:25:32,004 INFO L796 eck$LassoCheckResult]: Loop: 171#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 167#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 168#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 161#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 162#L9 [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 171#L9-2 [2020-06-22 07:25:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2317061, now seen corresponding path program 1 times [2020-06-22 07:25:32,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,008 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,008 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash 85910572, now seen corresponding path program 1 times [2020-06-22 07:25:32,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,067 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,067 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -223360088, now seen corresponding path program 1 times [2020-06-22 07:25:32,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,126 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,126 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:32,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 07:25:32,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 07:25:32,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-06-22 07:25:32,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-06-22 07:25:32,275 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:32,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:32,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:32,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:32,275 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:25:32,276 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:32,276 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:32,276 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:32,276 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 07:25:32,276 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:32,276 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:32,278 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 07:25:32,309 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 07:25:32,311 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 07:25:32,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:32,381 INFO L412 LassoAnalysis]: Checking for nontermination... 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 07:25:32,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:32,385 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 07:25:32,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:25:32,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:32,425 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:25:32,448 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:32,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:32,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:32,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:32,449 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:25:32,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:25:32,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:32,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:32,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 07:25:32,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:32,449 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:32,451 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 07:25:32,472 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 07:25:32,475 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 07:25:32,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:32,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:25:32,545 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 07:25:32,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:32,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:32,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:32,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:32,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:32,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:32,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:32,555 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:25:32,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 07:25:32,561 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 07:25:32,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:25:32,562 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:25:32,562 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:25:32,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~b~0) = 2*ULTIMATE.start_fermat_~MAX~0 - 2*ULTIMATE.start_fermat_~b~0 + 1 Supporting invariants [] [2020-06-22 07:25:32,562 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:25:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:32,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 07:25:32,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:32,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:32,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:32,604 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 07:25:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:32,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:32,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:32,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:32,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:32,705 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 07:25:32,705 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 07:25:32,705 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 07:25:32,752 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 74 states and 110 transitions. Complement of second has 12 states. [2020-06-22 07:25:32,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 07:25:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 07:25:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 07:25:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 5 letters. [2020-06-22 07:25:32,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 5 letters. [2020-06-22 07:25:32,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:32,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 07:25:32,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:32,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 110 transitions. [2020-06-22 07:25:32,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 07:25:32,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 35 states and 52 transitions. [2020-06-22 07:25:32,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 07:25:32,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 07:25:32,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2020-06-22 07:25:32,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:25:32,762 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-06-22 07:25:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2020-06-22 07:25:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 07:25:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 07:25:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-06-22 07:25:32,765 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-06-22 07:25:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 07:25:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 07:25:32,766 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 5 states. [2020-06-22 07:25:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:25:32,821 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. [2020-06-22 07:25:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 07:25:32,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 108 transitions. [2020-06-22 07:25:32,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 07:25:32,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 108 transitions. [2020-06-22 07:25:32,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 07:25:32,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 07:25:32,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 108 transitions. [2020-06-22 07:25:32,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:25:32,828 INFO L706 BuchiCegarLoop]: Abstraction has 75 states and 108 transitions. [2020-06-22 07:25:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 108 transitions. [2020-06-22 07:25:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2020-06-22 07:25:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 07:25:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2020-06-22 07:25:32,833 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 76 transitions. [2020-06-22 07:25:32,833 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 76 transitions. [2020-06-22 07:25:32,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 07:25:32,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 76 transitions. [2020-06-22 07:25:32,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 07:25:32,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:25:32,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:25:32,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:32,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:32,836 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 476#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 501#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 500#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 499#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 482#L13-1 [2020-06-22 07:25:32,836 INFO L796 eck$LassoCheckResult]: Loop: 482#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 513#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 505#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 485#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 481#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 482#L13-1 [2020-06-22 07:25:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 71828951, now seen corresponding path program 1 times [2020-06-22 07:25:32,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash 86604326, now seen corresponding path program 1 times [2020-06-22 07:25:32,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,895 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,895 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1665772048, now seen corresponding path program 1 times [2020-06-22 07:25:32,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:32,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:32,945 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:32,945 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:32,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:32,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:33,072 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:33,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:33,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:33,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:33,072 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:25:33,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:33,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:33,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:33,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 07:25:33,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:33,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:33,074 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 07:25:33,076 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 07:25:33,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:33,209 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:33,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:33,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:33,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:25:33,221 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_fermat_#t~post0=0} Honda state: {ULTIMATE.start_fermat_#t~post0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:33,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:33,248 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:33,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:25:33,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:33,284 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:25:33,308 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:33,309 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:33,309 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:33,309 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:33,309 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:25:33,309 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:25:33,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:33,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:33,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 07:25:33,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:33,310 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:33,311 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 07:25:33,313 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 07:25:33,514 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-06-22 07:25:33,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:33,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:25:33,561 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 07:25:33,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:33,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:33,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:33,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:33,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:33,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:33,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:33,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:25:33,565 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 07:25:33,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:33,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:33,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:33,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:33,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:33,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:33,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:33,573 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:25:33,578 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 07:25:33,578 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 07:25:33,578 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:25:33,578 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:25:33,578 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:25:33,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_~a~0) = 1*ULTIMATE.start_fermat_~MAX~0 - 1*ULTIMATE.start_fermat_~a~0 Supporting invariants [] [2020-06-22 07:25:33,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:25:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:33,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 07:25:33,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:33,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:33,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:33,619 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 07:25:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:33,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:33,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:33,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:33,661 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 07:25:33,661 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 07:25:33,662 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 76 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-06-22 07:25:33,732 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 76 transitions. cyclomatic complexity: 28. Second operand 5 states. Result 156 states and 227 transitions. Complement of second has 20 states. [2020-06-22 07:25:33,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 07:25:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 07:25:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-06-22 07:25:33,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 07:25:33,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:33,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 07:25:33,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:33,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 07:25:33,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:33,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 227 transitions. [2020-06-22 07:25:33,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:33,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 60 states and 86 transitions. [2020-06-22 07:25:33,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 07:25:33,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 07:25:33,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 86 transitions. [2020-06-22 07:25:33,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:25:33,743 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 86 transitions. [2020-06-22 07:25:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 86 transitions. [2020-06-22 07:25:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 33. [2020-06-22 07:25:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 07:25:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2020-06-22 07:25:33,747 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2020-06-22 07:25:33,747 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2020-06-22 07:25:33,747 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 07:25:33,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 47 transitions. [2020-06-22 07:25:33,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 07:25:33,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:25:33,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:25:33,748 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1] [2020-06-22 07:25:33,748 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:25:33,749 INFO L794 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY [45] ULTIMATE.startENTRY-->L4-2: Formula: (and (= v_ULTIMATE.start_fermat_~a~0_1 1) (= v_ULTIMATE.start_fermat_~c~0_2 1) (= v_ULTIMATE.start_fermat_~MAX~0_2 1000) (= v_ULTIMATE.start_fermat_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_2, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_2, ULTIMATE.start_fermat_#res=|v_ULTIMATE.start_fermat_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_1|, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_1, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_1, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_1|, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_~MAX~0, ULTIMATE.start_fermat_#res, ULTIMATE.start_main_#res, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post0, ULTIMATE.start_fermat_#t~post1, ULTIMATE.start_main_#t~ret3] 782#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 790#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 796#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 794#L9-2 [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 785#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 786#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 779#L5 [63] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (< (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 780#L9 [59] L9-->L9-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_6 v_ULTIMATE.start_fermat_~a~0_9) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_6, ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_9} AuxVars[] AssignedVars[] 791#L9-2 [49] L9-2-->L13-1: Formula: (and (< v_ULTIMATE.start_fermat_~MAX~0_7 v_ULTIMATE.start_fermat_~b~0_9) (= (+ v_ULTIMATE.start_fermat_~c~0_8 1) v_ULTIMATE.start_fermat_~c~0_7) (= v_ULTIMATE.start_fermat_~b~0_8 1)) InVars {ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_9, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_8, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} OutVars{ULTIMATE.start_fermat_#t~post2=|v_ULTIMATE.start_fermat_#t~post2_2|, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_8, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_7} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~c~0, ULTIMATE.start_fermat_#t~post2, ULTIMATE.start_fermat_~b~0] 792#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 784#L4-2 [2020-06-22 07:25:33,749 INFO L796 eck$LassoCheckResult]: Loop: 784#L4-2 [53] L4-2-->L5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 777#L5 [62] L5-->L9: Formula: (and (= (+ v_ULTIMATE.start_fermat_~a~0_6 1) v_ULTIMATE.start_fermat_~a~0_5) (> (* (* v_ULTIMATE.start_fermat_~a~0_6 v_ULTIMATE.start_fermat_~a~0_6) v_ULTIMATE.start_fermat_~a~0_6) (+ (* (* v_ULTIMATE.start_fermat_~b~0_5 v_ULTIMATE.start_fermat_~b~0_5) v_ULTIMATE.start_fermat_~b~0_5) (* (* v_ULTIMATE.start_fermat_~c~0_6 v_ULTIMATE.start_fermat_~c~0_6) v_ULTIMATE.start_fermat_~c~0_6)))) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_6, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_5, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_5, ULTIMATE.start_fermat_#t~post0=|v_ULTIMATE.start_fermat_#t~post0_2|, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_6} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_#t~post0] 778#L9 [55] L9-->L9-2: Formula: (and (= (+ v_ULTIMATE.start_fermat_~b~0_7 1) v_ULTIMATE.start_fermat_~b~0_6) (= v_ULTIMATE.start_fermat_~a~0_7 1) (< v_ULTIMATE.start_fermat_~MAX~0_5 v_ULTIMATE.start_fermat_~a~0_8)) InVars {ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_7, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} OutVars{ULTIMATE.start_fermat_~a~0=v_ULTIMATE.start_fermat_~a~0_7, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_6, ULTIMATE.start_fermat_#t~post1=|v_ULTIMATE.start_fermat_#t~post1_2|, ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_5} AuxVars[] AssignedVars[ULTIMATE.start_fermat_~a~0, ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_#t~post1] 787#L9-2 [60] L9-2-->L13-1: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_8 v_ULTIMATE.start_fermat_~b~0_10) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_8, ULTIMATE.start_fermat_~b~0=v_ULTIMATE.start_fermat_~b~0_10} AuxVars[] AssignedVars[] 783#L13-1 [61] L13-1-->L4-2: Formula: (>= v_ULTIMATE.start_fermat_~MAX~0_1 v_ULTIMATE.start_fermat_~c~0_1) InVars {ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} OutVars{ULTIMATE.start_fermat_~MAX~0=v_ULTIMATE.start_fermat_~MAX~0_1, ULTIMATE.start_fermat_~c~0=v_ULTIMATE.start_fermat_~c~0_1} AuxVars[] AssignedVars[] 784#L4-2 [2020-06-22 07:25:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1073250452, now seen corresponding path program 1 times [2020-06-22 07:25:33,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:33,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:33,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:33,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:33,753 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:33,753 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:33,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:33,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:33,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 07:25:33,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 07:25:33,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:25:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 07:25:33,809 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 07:25:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 79477582, now seen corresponding path program 2 times [2020-06-22 07:25:33,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:25:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:25:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:25:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:25:33,811 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 07:25:33,811 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 07:25:33,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 07:25:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 07:25:33,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-06-22 07:25:33,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 07:25:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:25:34,393 WARN L188 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-06-22 07:25:34,426 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:34,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:34,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:34,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:34,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:25:34,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:34,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:34,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:34,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 07:25:34,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:34,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:34,428 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 07:25:34,463 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 07:25:34,464 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 07:25:34,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:34,553 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:34,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:25:34,560 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:25:34,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:25:34,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:25:34,598 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:25:34,621 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:25:34,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:25:34,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:25:34,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:25:34,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:25:34,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:25:34,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:25:34,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:25:34,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 07:25:34,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:25:34,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:25:34,624 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 07:25:39,722 WARN L188 SmtUtils]: Spent 5.09 s on a formula simplification that was a NOOP. DAG size: 23 [2020-06-22 07:25:39,722 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 07:25:39,724 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 07:25:40,025 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-06-22 07:25:40,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:25:40,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:25:40,059 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 07:25:40,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:25:40,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:25:40,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:25:40,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:25:40,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:25:40,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:25:40,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:25:40,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:25:40,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 07:25:40,075 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 07:25:40,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:25:40,075 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:25:40,076 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:25:40,076 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_fermat_~b~0, ULTIMATE.start_fermat_~MAX~0) = -1*ULTIMATE.start_fermat_~b~0 + 1*ULTIMATE.start_fermat_~MAX~0 Supporting invariants [] [2020-06-22 07:25:40,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:25:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:25:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:40,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 07:25:40,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:40,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:40,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:40,134 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 07:25:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:40,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:40,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:40,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:40,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:25:40,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:25:40,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:25:40,180 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 07:25:40,180 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 07:25:40,180 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states and 47 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-06-22 07:25:40,256 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states and 47 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 206 states and 303 transitions. Complement of second has 39 states. [2020-06-22 07:25:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 07:25:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 07:25:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2020-06-22 07:25:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 11 letters. Loop has 5 letters. [2020-06-22 07:25:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 16 letters. Loop has 5 letters. [2020-06-22 07:25:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 11 letters. Loop has 10 letters. [2020-06-22 07:25:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:25:40,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 303 transitions. [2020-06-22 07:25:40,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 07:25:40,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 0 states and 0 transitions. [2020-06-22 07:25:40,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 07:25:40,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 07:25:40,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 07:25:40,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 07:25:40,265 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:25:40,265 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:25:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 07:25:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 07:25:40,265 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-06-22 07:25:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:25:40,266 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 07:25:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 07:25:40,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 07:25:40,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 07:25:40,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 07:25:40,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 07:25:40,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 07:25:40,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 07:25:40,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 07:25:40,268 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:25:40,268 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:25:40,268 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:25:40,268 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 07:25:40,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 07:25:40,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 07:25:40,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 07:25:40,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:25:40 BasicIcfg [2020-06-22 07:25:40,274 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 07:25:40,275 INFO L168 Benchmark]: Toolchain (without parser) took 15446.16 ms. Allocated memory was 649.6 MB in the beginning and 753.4 MB in the end (delta: 103.8 MB). Free memory was 558.7 MB in the beginning and 526.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 135.6 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,276 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 07:25:40,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.33 ms. Allocated memory was 649.6 MB in the beginning and 697.3 MB in the end (delta: 47.7 MB). Free memory was 558.7 MB in the beginning and 662.8 MB in the end (delta: -104.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 697.3 MB. Free memory was 662.8 MB in the beginning and 661.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,277 INFO L168 Benchmark]: Boogie Preprocessor took 20.20 ms. Allocated memory is still 697.3 MB. Free memory was 661.7 MB in the beginning and 658.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,278 INFO L168 Benchmark]: RCFGBuilder took 228.39 ms. Allocated memory is still 697.3 MB. Free memory was 658.9 MB in the beginning and 644.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,278 INFO L168 Benchmark]: BlockEncodingV2 took 83.96 ms. Allocated memory is still 697.3 MB. Free memory was 644.1 MB in the beginning and 637.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,279 INFO L168 Benchmark]: TraceAbstraction took 157.90 ms. Allocated memory is still 697.3 MB. Free memory was 637.6 MB in the beginning and 627.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,279 INFO L168 Benchmark]: BuchiAutomizer took 14617.69 ms. Allocated memory was 697.3 MB in the beginning and 753.4 MB in the end (delta: 56.1 MB). Free memory was 627.9 MB in the beginning and 526.9 MB in the end (delta: 101.0 MB). Peak memory consumption was 157.1 MB. Max. memory is 50.3 GB. [2020-06-22 07:25:40,283 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 16 edges - StatisticsResult: Encoded RCFG 6 locations, 9 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.33 ms. Allocated memory was 649.6 MB in the beginning and 697.3 MB in the end (delta: 47.7 MB). Free memory was 558.7 MB in the beginning and 662.8 MB in the end (delta: -104.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 697.3 MB. Free memory was 662.8 MB in the beginning and 661.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.20 ms. Allocated memory is still 697.3 MB. Free memory was 661.7 MB in the beginning and 658.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 228.39 ms. Allocated memory is still 697.3 MB. Free memory was 658.9 MB in the beginning and 644.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 83.96 ms. Allocated memory is still 697.3 MB. Free memory was 644.1 MB in the beginning and 637.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 157.90 ms. Allocated memory is still 697.3 MB. Free memory was 637.6 MB in the beginning and 627.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 14617.69 ms. Allocated memory was 697.3 MB in the beginning and 753.4 MB in the end (delta: 56.1 MB). Free memory was 627.9 MB in the beginning and 526.9 MB in the end (delta: 101.0 MB). Peak memory consumption was 157.1 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: 4]: 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 7 terminating modules (3 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function MAX + -1 * c and consists of 4 locations. One nondeterministic module has affine ranking function 2 * MAX + -2 * b + 1 and consists of 4 locations. One nondeterministic module has affine ranking function MAX + -1 * a and consists of 6 locations. One nondeterministic module has affine ranking function -1 * b + MAX and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 97 SDslu, 19 SDs, 0 SdLazy, 191 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq125 hnf95 smp100 dnf100 smp100 tf104 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 07:25:21.609 ----------------------------------------------- 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 07:25:40.517 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check