YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 03:51:27,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 03:51:27,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 03:51:27,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 03:51:27,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 03:51:27,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 03:51:27,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 03:51:27,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 03:51:27,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 03:51:27,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 03:51:27,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 03:51:27,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 03:51:27,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 03:51:27,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 03:51:27,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 03:51:27,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 03:51:27,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 03:51:27,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 03:51:27,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 03:51:27,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 03:51:27,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 03:51:27,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 03:51:27,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 03:51:27,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 03:51:27,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 03:51:27,259 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 03:51:27,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 03:51:27,260 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 03:51:27,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 03:51:27,261 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 03:51:27,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 03:51:27,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 03:51:27,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 03:51:27,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 03:51:27,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 03:51:27,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 03:51:27,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 03:51:27,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 03:51:27,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 03:51:27,266 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 03:51:27,280 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 03:51:27,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 03:51:27,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 03:51:27,281 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 03:51:27,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 03:51:27,282 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:51:27,282 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 03:51:27,282 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 03:51:27,282 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 03:51:27,282 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 03:51:27,282 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:27,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 03:51:27,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 03:51:27,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 03:51:27,284 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 03:51:27,284 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 03:51:27,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 03:51:27,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 03:51:27,284 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 03:51:27,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:51:27,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 03:51:27,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 03:51:27,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 03:51:27,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 03:51:27,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 03:51:27,324 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 03:51:27,328 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 03:51:27,329 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 03:51:27,329 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 03:51:27,330 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 03:51:27,392 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/151dd183701549a88d6abfd05e780e45/FLAG55f0e177e [2020-06-22 03:51:27,731 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 03:51:27,732 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 03:51:27,739 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/151dd183701549a88d6abfd05e780e45/FLAG55f0e177e [2020-06-22 03:51:28,141 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/151dd183701549a88d6abfd05e780e45 [2020-06-22 03:51:28,156 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 03:51:28,158 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 03:51:28,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 03:51:28,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 03:51:28,165 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 03:51:28,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ee8972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 03:51:28,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 03:51:28,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:51:28,371 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 03:51:28,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:51:28,465 INFO L195 MainTranslator]: Completed translation [2020-06-22 03:51:28,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28 WrapperNode [2020-06-22 03:51:28,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 03:51:28,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 03:51:28,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 03:51:28,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 03:51:28,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 03:51:28,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 03:51:28,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 03:51:28,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 03:51:28,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 03:51:28,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 03:51:28,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 03:51:28,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 03:51:28,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:51:28,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 03:51:28,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 03:51:28,746 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 03:51:28,746 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 03:51:28,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:28 BoogieIcfgContainer [2020-06-22 03:51:28,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 03:51:28,748 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 03:51:28,748 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 03:51:28,750 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 03:51:28,751 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:28" (1/1) ... [2020-06-22 03:51:28,767 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 13 edges [2020-06-22 03:51:28,769 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 03:51:28,770 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 03:51:28,770 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 03:51:28,771 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:51:28,773 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 03:51:28,774 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 03:51:28,774 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 03:51:28,789 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 03:51:28,805 INFO L200 BlockEncoder]: SBE split 2 edges [2020-06-22 03:51:28,809 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 03:51:28,811 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:51:28,824 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 03:51:28,826 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 03:51:28,827 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:51:28,827 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:51:28,831 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 03:51:28,831 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:51:28,832 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:51:28,832 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:51:28,832 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 03:51:28,833 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:51:28,833 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 5 edges [2020-06-22 03:51:28,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:28 BasicIcfg [2020-06-22 03:51:28,833 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 03:51:28,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 03:51:28,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 03:51:28,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 03:51:28,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 03:51:28" (1/4) ... [2020-06-22 03:51:28,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799330c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (2/4) ... [2020-06-22 03:51:28,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799330c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:28" (3/4) ... [2020-06-22 03:51:28,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799330c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:28" (4/4) ... [2020-06-22 03:51:28,841 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:51:28,851 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 03:51:28,859 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 03:51:28,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 03:51:28,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:51:28,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 03:51:28,906 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 03:51:28,906 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:51:28,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:51:28,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:51:28,906 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 03:51:28,906 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:51:28,906 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 03:51:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 03:51:28,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 03:51:28,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 03:51:28,978 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2020-06-22 03:51:28,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 03:51:28,978 INFO L451 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: true [2020-06-22 03:51:28,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:28 BasicIcfg [2020-06-22 03:51:28,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 03:51:28,989 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 03:51:28,989 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 03:51:28,993 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 03:51:28,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:28,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 03:51:28" (1/5) ... [2020-06-22 03:51:28,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b6813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:28,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:28" (2/5) ... [2020-06-22 03:51:28,996 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b6813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:28,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:28" (3/5) ... [2020-06-22 03:51:28,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b6813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,997 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:28,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:28" (4/5) ... [2020-06-22 03:51:28,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77b6813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:28, skipping insertion in model container [2020-06-22 03:51:28,998 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:28,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:28" (5/5) ... [2020-06-22 03:51:29,000 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:51:29,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:51:29,030 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 03:51:29,030 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 03:51:29,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:51:29,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:51:29,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:51:29,031 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 03:51:29,031 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:51:29,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 03:51:29,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 03:51:29,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 03:51:29,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:29,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:29,060 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:51:29,061 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:29,061 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 03:51:29,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 03:51:29,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 03:51:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:29,062 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:51:29,062 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:29,067 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 5#L15-2true [2020-06-22 03:51:29,068 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-2true [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 3#L15true [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 5#L15-2true [2020-06-22 03:51:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 1 times [2020-06-22 03:51:29,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2590, now seen corresponding path program 1 times [2020-06-22 03:51:29,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash 86197, now seen corresponding path program 1 times [2020-06-22 03:51:29,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:29,272 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:29,273 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:29,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:29,273 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:29,273 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:51:29,274 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:29,274 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:29,274 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:29,274 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 03:51:29,274 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:29,274 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:29,301 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 03:51:29,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 03:51:29,315 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 03:51:29,318 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 03:51:29,363 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 03:51:29,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:29,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:29,466 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:29,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:29,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:29,480 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:29,480 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:29,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:29,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:29,515 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:29,515 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_#res=0} Honda state: {ULTIMATE.start_gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:29,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:29,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:29,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:29,548 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=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 03:51:29,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:29,578 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 03:51:29,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:51:29,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:29,855 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:51:29,859 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:29,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:29,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:29,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:29,860 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:29,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:29,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:29,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:29,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 03:51:29,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:29,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:29,862 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 03:51:29,866 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 03:51:29,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:29,872 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 03:51:29,875 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 03:51:29,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:30,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:30,012 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:30,015 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 03:51:30,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:30,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:30,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:30,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:30,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:30,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:30,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:30,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:30,022 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 03:51:30,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:30,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:30,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:30,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:30,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:30,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:30,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:30,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:30,025 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 03:51:30,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:30,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:30,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:30,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:30,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:30,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:30,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:30,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:30,028 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 03:51:30,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:30,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:30,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:30,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:30,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:30,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:30,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:30,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:30,032 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 03:51:30,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:30,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:30,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:30,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:30,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:30,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:30,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:30,135 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 03:51:30,136 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 03:51:30,138 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:30,141 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 03:51:30,142 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:30,142 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y2 - 1*ULTIMATE.start_gcd_~y1 Supporting invariants [1*ULTIMATE.start_gcd_~y1 - 1 >= 0] [2020-06-22 03:51:30,152 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 03:51:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:30,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:30,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:30,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:30,221 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 03:51:30,245 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 03:51:30,250 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 03:51:30,251 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-22 03:51:30,345 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 9 states and 20 transitions. Complement of second has 6 states. [2020-06-22 03:51:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 03:51:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:51:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-06-22 03:51:30,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 03:51:30,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:30,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 03:51:30,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:30,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 03:51:30,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:30,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 20 transitions. [2020-06-22 03:51:30,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 03:51:30,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 15 transitions. [2020-06-22 03:51:30,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 03:51:30,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 03:51:30,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 15 transitions. [2020-06-22 03:51:30,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:51:30,369 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. [2020-06-22 03:51:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 15 transitions. [2020-06-22 03:51:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 03:51:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 03:51:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2020-06-22 03:51:30,401 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. [2020-06-22 03:51:30,402 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 15 transitions. [2020-06-22 03:51:30,402 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 03:51:30,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 15 transitions. [2020-06-22 03:51:30,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 03:51:30,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:30,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:30,403 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 03:51:30,403 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:30,404 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 61#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 56#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 57#L15-2 [2020-06-22 03:51:30,404 INFO L796 eck$LassoCheckResult]: Loop: 57#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 62#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 57#L15-2 [2020-06-22 03:51:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash 86213, now seen corresponding path program 1 times [2020-06-22 03:51:30,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:30,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2590, now seen corresponding path program 2 times [2020-06-22 03:51:30,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:30,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 82852322, now seen corresponding path program 1 times [2020-06-22 03:51:30,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:30,507 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:30,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:30,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:30,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:30,508 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:51:30,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:30,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:30,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:30,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 03:51:30,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:30,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:30,510 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 03:51:30,529 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 03:51:30,532 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 03:51:30,535 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 03:51:30,537 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 03:51:30,539 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 03:51:30,626 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:30,626 INFO L412 LassoAnalysis]: Checking for nontermination... 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 03:51:30,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:30,633 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:30,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:51:30,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:30,895 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:51:30,899 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:30,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:30,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:30,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:30,899 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:30,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:30,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:30,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:30,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 03:51:30,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:30,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:30,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:30,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:30,925 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 03:51:30,927 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 03:51:30,929 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 03:51:30,931 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 03:51:31,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:31,022 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:31,022 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 03:51:31,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:31,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:31,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:31,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:31,026 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 03:51:31,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:31,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:31,058 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:31,073 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 03:51:31,073 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:51:31,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:31,075 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 03:51:31,076 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:31,076 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y2 - 1*ULTIMATE.start_gcd_~y1 Supporting invariants [1*ULTIMATE.start_gcd_~y1 - 1 >= 0] [2020-06-22 03:51:31,079 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 03:51:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:31,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:51:31,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:31,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:31,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:31,153 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 03:51:31,182 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 03:51:31,182 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-06-22 03:51:31,182 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 15 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-06-22 03:51:31,244 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 15 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 43 states and 86 transitions. Complement of second has 29 states. [2020-06-22 03:51:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 03:51:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:51:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-06-22 03:51:31,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 03:51:31,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:31,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 03:51:31,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:31,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 03:51:31,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:31,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 86 transitions. [2020-06-22 03:51:31,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:51:31,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 16 states and 28 transitions. [2020-06-22 03:51:31,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 03:51:31,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 03:51:31,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. [2020-06-22 03:51:31,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 03:51:31,254 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 03:51:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. [2020-06-22 03:51:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 5. [2020-06-22 03:51:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:51:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2020-06-22 03:51:31,255 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 9 transitions. [2020-06-22 03:51:31,256 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 9 transitions. [2020-06-22 03:51:31,256 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 03:51:31,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 9 transitions. [2020-06-22 03:51:31,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:51:31,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:31,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:31,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:51:31,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:31,257 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 180#L15-2 [2020-06-22 03:51:31,257 INFO L796 eck$LassoCheckResult]: Loop: 180#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 179#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 180#L15-2 [2020-06-22 03:51:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 2 times [2020-06-22 03:51:31,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:31,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:31,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:31,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2575, now seen corresponding path program 1 times [2020-06-22 03:51:31,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:31,295 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 03:51:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 03:51:31,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:51:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:31,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:31,302 INFO L87 Difference]: Start difference. First operand 5 states and 9 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-06-22 03:51:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:31,317 INFO L93 Difference]: Finished difference Result 6 states and 9 transitions. [2020-06-22 03:51:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:31,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 9 transitions. [2020-06-22 03:51:31,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:51:31,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 5 states and 7 transitions. [2020-06-22 03:51:31,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-06-22 03:51:31,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-06-22 03:51:31,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7 transitions. [2020-06-22 03:51:31,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:31,320 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 03:51:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 7 transitions. [2020-06-22 03:51:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-22 03:51:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:51:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-06-22 03:51:31,321 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 03:51:31,322 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-06-22 03:51:31,322 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 03:51:31,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2020-06-22 03:51:31,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:51:31,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:31,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:31,323 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 03:51:31,323 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:31,323 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 197#L15-2 [2020-06-22 03:51:31,323 INFO L796 eck$LassoCheckResult]: Loop: 197#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 196#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 197#L15-2 [2020-06-22 03:51:31,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 3 times [2020-06-22 03:51:31,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2606, now seen corresponding path program 1 times [2020-06-22 03:51:31,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:31,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:31,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 86213, now seen corresponding path program 2 times [2020-06-22 03:51:31,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:31,376 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:31,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:31,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:31,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:31,377 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:51:31,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:31,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:31,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:31,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 03:51:31,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:31,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:31,379 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 03:51:31,381 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 03:51:31,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:31,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:31,423 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 03:51:31,425 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 03:51:31,490 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:31,490 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:31,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:31,493 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:31,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:31,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:31,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:31,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:31,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:31,529 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 03:51:31,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:31,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:31,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 03:51:31,562 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 03:51:31,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:31,590 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:31,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:51:31,627 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:31,859 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:51:31,861 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:31,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:31,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:31,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:31,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:31,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:31,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:31,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:31,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 03:51:31,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:31,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:31,865 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 03:51:31,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:31,870 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 03:51:31,872 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 03:51:31,874 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 03:51:31,895 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 03:51:31,973 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:31,973 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:31,974 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 03:51:31,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:31,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:31,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:31,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:31,977 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 03:51:31,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:31,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:31,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:31,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:31,980 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 03:51:31,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:31,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:31,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:31,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:31,982 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 03:51:31,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:31,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:31,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:31,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:31,984 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 03:51:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:31,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:31,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:31,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:32,008 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:32,020 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 03:51:32,020 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:51:32,021 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:32,022 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 03:51:32,022 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:32,023 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = -1*ULTIMATE.start_gcd_~y2 + 1*ULTIMATE.start_gcd_~y1 Supporting invariants [1*ULTIMATE.start_gcd_~y2 - 1 >= 0] [2020-06-22 03:51:32,025 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 03:51:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:32,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:32,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:32,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:32,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:32,087 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 03:51:32,123 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:51:32,123 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 03:51:32,123 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-06-22 03:51:32,180 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 6 states. [2020-06-22 03:51:32,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 03:51:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 03:51:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-22 03:51:32,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 03:51:32,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:32,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 03:51:32,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:32,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 03:51:32,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:32,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2020-06-22 03:51:32,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:51:32,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2020-06-22 03:51:32,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 03:51:32,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 03:51:32,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-06-22 03:51:32,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:32,186 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-06-22 03:51:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-06-22 03:51:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 03:51:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 03:51:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 03:51:32,187 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 03:51:32,188 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 03:51:32,188 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 03:51:32,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 03:51:32,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 03:51:32,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:32,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:32,189 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:32,189 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 03:51:32,189 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 260#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 261#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 262#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 255#L15 [2020-06-22 03:51:32,189 INFO L796 eck$LassoCheckResult]: Loop: 255#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 256#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 255#L15 [2020-06-22 03:51:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2672159, now seen corresponding path program 1 times [2020-06-22 03:51:32,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:32,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:32,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2036, now seen corresponding path program 2 times [2020-06-22 03:51:32,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:32,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:32,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:32,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:32,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1727021422, now seen corresponding path program 2 times [2020-06-22 03:51:32,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:32,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:32,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:32,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:32,268 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:32,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:32,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:32,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:32,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:51:32,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:32,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:32,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:32,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 03:51:32,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:32,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:32,271 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 03:51:32,291 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 03:51:32,296 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 03:51:32,298 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 03:51: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 03:51: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 03:51:32,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:32,385 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:32,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:32,392 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:32,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:51:32,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:32,704 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:51:32,707 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:32,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:32,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:32,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:32,707 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:32,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:32,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:32,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:32,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 03:51:32,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:32,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:32,709 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 03:51:32,712 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 03:51:32,716 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 03:51:32,719 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 03:51:32,721 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 03:51:32,723 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 03:51:32,819 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:32,819 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:32,820 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 03:51:32,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:32,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:32,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:32,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:32,823 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 03:51:32,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:32,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:32,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:32,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:32,825 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 03:51:32,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:32,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:32,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:32,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:32,828 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 03:51:32,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:32,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:32,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:32,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:32,830 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 03:51:32,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:32,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:32,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:32,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:32,832 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 03:51:32,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:32,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:32,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:32,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:32,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:32,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:32,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:32,863 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 03:51:32,863 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 03:51:32,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:32,864 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 03:51:32,865 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:32,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1) = -1*ULTIMATE.start_gcd_~y2 + 1*ULTIMATE.start_gcd_~y1 Supporting invariants [1*ULTIMATE.start_gcd_~y2 - 1 >= 0] [2020-06-22 03:51:32,867 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 03:51:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:32,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 03:51:32,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:32,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:32,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:32,951 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 03:51:32,994 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 03:51:32,994 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-06-22 03:51:32,994 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 03:51:33,076 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 16 states and 20 transitions. Complement of second has 8 states. [2020-06-22 03:51:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 03:51:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 03:51:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-06-22 03:51:33,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 03:51:33,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:33,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 03:51:33,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:33,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 03:51:33,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:33,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-06-22 03:51:33,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:33,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2020-06-22 03:51:33,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-06-22 03:51:33,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-06-22 03:51:33,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-06-22 03:51:33,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:33,082 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-06-22 03:51:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-06-22 03:51:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2020-06-22 03:51:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 03:51:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-06-22 03:51:33,083 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 03:51:33,083 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-06-22 03:51:33,083 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 03:51:33,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-06-22 03:51:33,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 03:51:33,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:33,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:33,085 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:33,085 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:51:33,085 INFO L794 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L15-2: Formula: (and (< 0 v_ULTIMATE.start_main_~y1~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_main_~y1~0_6) (< 0 v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_gcd_~y2_10) (= |v_ULTIMATE.start_gcd_#in~y2_2| v_ULTIMATE.start_main_~y2~0_6) (= |v_ULTIMATE.start_gcd_#in~y1_2| v_ULTIMATE.start_gcd_~y1_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~ret2=|v_ULTIMATE.start_main_#t~ret2_5|, ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_10, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_11, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_2|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_6|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~ret2, ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0] 341#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 342#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 343#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 337#L15 [2020-06-22 03:51:33,085 INFO L796 eck$LassoCheckResult]: Loop: 337#L15 [33] L15-->L15-2: Formula: (and (< v_ULTIMATE.start_gcd_~y2_5 v_ULTIMATE.start_gcd_~y1_6) (= v_ULTIMATE.start_gcd_~y1_5 (+ v_ULTIMATE.start_gcd_~y1_6 (* (- 1) v_ULTIMATE.start_gcd_~y2_5)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_6} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_5, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y1] 338#L15-2 [51] L15-2-->L15: Formula: (> v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 342#L15 [48] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_gcd_~y2_6 (+ (* (- 1) v_ULTIMATE.start_gcd_~y1_7) v_ULTIMATE.start_gcd_~y2_7)) (>= v_ULTIMATE.start_gcd_~y2_7 v_ULTIMATE.start_gcd_~y1_7)) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_7, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_6, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2] 343#L15-2 [52] L15-2-->L15: Formula: (< v_ULTIMATE.start_gcd_~y2_4 v_ULTIMATE.start_gcd_~y1_4) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_4, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_4} AuxVars[] AssignedVars[] 337#L15 [2020-06-22 03:51:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2672159, now seen corresponding path program 2 times [2020-06-22 03:51:33,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:33,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1957175, now seen corresponding path program 1 times [2020-06-22 03:51:33,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:33,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:33,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1810209707, now seen corresponding path program 3 times [2020-06-22 03:51:33,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:33,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:33,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:33,148 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:33,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:33,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:33,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:33,149 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 03:51:33,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:33,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:33,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:33,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 03:51:33,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:33,149 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:33,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:33,187 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:33,187 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 03:51:33,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 03:51:33,191 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 03:51:33,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 03:51:33,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 03:51:33,618 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 03:51:33,621 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:33,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:33,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:33,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:33,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:33,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:33,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:33,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:33,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 03:51:33,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:33,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:33,623 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 03:51:33,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:33,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:33,666 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 03:51:33,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:33,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:33,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:33,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:33,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:33,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:33,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:33,672 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:33,676 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 03:51:33,676 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 03:51:33,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:33,677 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 03:51:33,677 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:33,677 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_~y1) = 1*ULTIMATE.start_gcd_~y1 Supporting invariants [] [2020-06-22 03:51:33,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 03:51:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:33,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 03:51:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:33,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 03:51:33,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:33,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:33,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:33,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 03:51:33,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:33,835 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 03:51:33,835 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-22 03:51:33,835 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-06-22 03:51:34,231 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 61 states and 87 transitions. Complement of second has 43 states. [2020-06-22 03:51:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-22 03:51:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:51:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-06-22 03:51:34,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 03:51:34,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:34,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 03:51:34,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:34,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 21 transitions. Stem has 4 letters. Loop has 8 letters. [2020-06-22 03:51:34,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:34,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2020-06-22 03:51:34,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:51:34,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2020-06-22 03:51:34,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 03:51:34,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 03:51:34,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 03:51:34,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:34,239 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:34,239 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:34,239 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:34,239 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 03:51:34,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 03:51:34,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:51:34,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 03:51:34,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:34 BasicIcfg [2020-06-22 03:51:34,246 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 03:51:34,247 INFO L168 Benchmark]: Toolchain (without parser) took 6089.56 ms. Allocated memory was 649.6 MB in the beginning and 749.7 MB in the end (delta: 100.1 MB). Free memory was 564.2 MB in the beginning and 391.9 MB in the end (delta: 172.3 MB). Peak memory consumption was 272.4 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,248 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:51:34,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.01 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 564.2 MB in the beginning and 642.8 MB in the end (delta: -78.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 675.3 MB. Free memory was 642.8 MB in the beginning and 641.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,250 INFO L168 Benchmark]: Boogie Preprocessor took 20.25 ms. Allocated memory is still 675.3 MB. Free memory was 641.4 MB in the beginning and 638.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,251 INFO L168 Benchmark]: RCFGBuilder took 225.64 ms. Allocated memory is still 675.3 MB. Free memory was 638.3 MB in the beginning and 624.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,251 INFO L168 Benchmark]: BlockEncodingV2 took 85.33 ms. Allocated memory is still 675.3 MB. Free memory was 624.1 MB in the beginning and 617.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 03:51:34,252 INFO L168 Benchmark]: TraceAbstraction took 153.85 ms. Allocated memory is still 675.3 MB. Free memory was 616.2 MB in the beginning and 608.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,253 INFO L168 Benchmark]: BuchiAutomizer took 5257.27 ms. Allocated memory was 675.3 MB in the beginning and 749.7 MB in the end (delta: 74.4 MB). Free memory was 608.2 MB in the beginning and 391.9 MB in the end (delta: 216.2 MB). Peak memory consumption was 290.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:34,257 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 13 edges - StatisticsResult: Encoded RCFG 3 locations, 5 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 306.01 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 564.2 MB in the beginning and 642.8 MB in the end (delta: -78.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.96 ms. Allocated memory is still 675.3 MB. Free memory was 642.8 MB in the beginning and 641.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.25 ms. Allocated memory is still 675.3 MB. Free memory was 641.4 MB in the beginning and 638.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 225.64 ms. Allocated memory is still 675.3 MB. Free memory was 638.3 MB in the beginning and 624.1 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 85.33 ms. Allocated memory is still 675.3 MB. Free memory was 624.1 MB in the beginning and 617.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.85 ms. Allocated memory is still 675.3 MB. Free memory was 616.2 MB in the beginning and 608.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5257.27 ms. Allocated memory was 675.3 MB in the beginning and 749.7 MB in the end (delta: 74.4 MB). Free memory was 608.2 MB in the beginning and 391.9 MB in the end (delta: 216.2 MB). Peak memory consumption was 290.7 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: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 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=3occurred 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 6 terminating modules (1 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function y2 + -1 * y1 and consists of 4 locations. One nondeterministic module has affine ranking function y2 + -1 * y1 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y2 + y1 and consists of 5 locations. One nondeterministic module has affine ranking function y1 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 11 SDtfs, 62 SDslu, 0 SDs, 0 SdLazy, 134 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf91 smp100 dnf100 smp100 tf101 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 110ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 03:51:24.874 ----------------------------------------------- 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 03:51:34.495 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check