30.15/16.70 YES 30.15/16.70 30.15/16.70 Ultimate: Cannot open display: 30.15/16.70 This is Ultimate 0.1.24-8dc7c08-m 30.15/16.70 [2019-03-28 12:03:16,580 INFO L170 SettingsManager]: Resetting all preferences to default values... 30.15/16.70 [2019-03-28 12:03:16,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 30.15/16.70 [2019-03-28 12:03:16,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 30.15/16.70 [2019-03-28 12:03:16,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 30.15/16.70 [2019-03-28 12:03:16,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 30.15/16.70 [2019-03-28 12:03:16,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 30.15/16.70 [2019-03-28 12:03:16,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 30.15/16.70 [2019-03-28 12:03:16,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 30.15/16.70 [2019-03-28 12:03:16,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 30.15/16.70 [2019-03-28 12:03:16,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 30.15/16.70 [2019-03-28 12:03:16,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 30.15/16.70 [2019-03-28 12:03:16,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 30.15/16.70 [2019-03-28 12:03:16,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 30.15/16.70 [2019-03-28 12:03:16,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 30.15/16.70 [2019-03-28 12:03:16,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 30.15/16.70 [2019-03-28 12:03:16,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 30.15/16.70 [2019-03-28 12:03:16,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 30.15/16.70 [2019-03-28 12:03:16,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 30.15/16.70 [2019-03-28 12:03:16,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 30.15/16.70 [2019-03-28 12:03:16,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 30.15/16.70 [2019-03-28 12:03:16,617 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 30.15/16.70 [2019-03-28 12:03:16,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 30.15/16.70 [2019-03-28 12:03:16,618 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 30.15/16.70 [2019-03-28 12:03:16,619 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 30.15/16.70 [2019-03-28 12:03:16,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 30.15/16.70 [2019-03-28 12:03:16,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 30.15/16.70 [2019-03-28 12:03:16,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 30.15/16.70 [2019-03-28 12:03:16,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 30.15/16.70 [2019-03-28 12:03:16,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 30.15/16.70 [2019-03-28 12:03:16,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 30.15/16.70 [2019-03-28 12:03:16,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 30.15/16.70 [2019-03-28 12:03:16,625 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 30.15/16.70 [2019-03-28 12:03:16,640 INFO L110 SettingsManager]: Loading preferences was successful 30.15/16.70 [2019-03-28 12:03:16,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 30.15/16.70 [2019-03-28 12:03:16,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 30.15/16.70 [2019-03-28 12:03:16,641 INFO L133 SettingsManager]: * Rewrite not-equals=true 30.15/16.70 [2019-03-28 12:03:16,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 30.15/16.70 [2019-03-28 12:03:16,642 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 30.15/16.70 [2019-03-28 12:03:16,642 INFO L133 SettingsManager]: * Use SBE=true 30.15/16.70 [2019-03-28 12:03:16,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Use old map elimination=false 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 30.15/16.70 [2019-03-28 12:03:16,643 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 30.15/16.70 [2019-03-28 12:03:16,644 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:16,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 30.15/16.70 [2019-03-28 12:03:16,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 30.15/16.70 [2019-03-28 12:03:16,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE 30.15/16.70 [2019-03-28 12:03:16,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 30.15/16.70 [2019-03-28 12:03:16,645 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 30.15/16.70 [2019-03-28 12:03:16,645 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 30.15/16.70 [2019-03-28 12:03:16,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 30.15/16.70 [2019-03-28 12:03:16,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 30.15/16.70 [2019-03-28 12:03:16,645 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 30.15/16.70 [2019-03-28 12:03:16,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.15/16.70 [2019-03-28 12:03:16,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 30.15/16.70 [2019-03-28 12:03:16,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 30.15/16.70 [2019-03-28 12:03:16,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 30.15/16.70 [2019-03-28 12:03:16,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 30.15/16.70 [2019-03-28 12:03:16,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 30.15/16.70 [2019-03-28 12:03:16,686 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 30.15/16.70 [2019-03-28 12:03:16,690 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 30.15/16.70 [2019-03-28 12:03:16,691 INFO L271 PluginConnector]: Initializing CDTParser... 30.15/16.70 [2019-03-28 12:03:16,692 INFO L276 PluginConnector]: CDTParser initialized 30.15/16.70 [2019-03-28 12:03:16,692 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 30.15/16.70 [2019-03-28 12:03:16,759 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/9b5cf5129c8e4cd0b978de1cf1918934/FLAGa9d966f40 30.15/16.70 [2019-03-28 12:03:17,093 INFO L307 CDTParser]: Found 1 translation units. 30.15/16.70 [2019-03-28 12:03:17,093 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 30.15/16.70 [2019-03-28 12:03:17,100 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/9b5cf5129c8e4cd0b978de1cf1918934/FLAGa9d966f40 30.15/16.70 [2019-03-28 12:03:17,519 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/9b5cf5129c8e4cd0b978de1cf1918934 30.15/16.70 [2019-03-28 12:03:17,531 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 30.15/16.70 [2019-03-28 12:03:17,533 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 30.15/16.70 [2019-03-28 12:03:17,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 30.15/16.70 [2019-03-28 12:03:17,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 30.15/16.70 [2019-03-28 12:03:17,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 30.15/16.70 [2019-03-28 12:03:17,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d40edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:17,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 30.15/16.70 [2019-03-28 12:03:17,567 INFO L176 MainTranslator]: Built tables and reachable declarations 30.15/16.70 [2019-03-28 12:03:17,722 INFO L206 PostProcessor]: Analyzing one entry point: main 30.15/16.70 [2019-03-28 12:03:17,727 INFO L191 MainTranslator]: Completed pre-run 30.15/16.70 [2019-03-28 12:03:17,744 INFO L206 PostProcessor]: Analyzing one entry point: main 30.15/16.70 [2019-03-28 12:03:17,758 INFO L195 MainTranslator]: Completed translation 30.15/16.70 [2019-03-28 12:03:17,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17 WrapperNode 30.15/16.70 [2019-03-28 12:03:17,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 30.15/16.70 [2019-03-28 12:03:17,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 30.15/16.70 [2019-03-28 12:03:17,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 30.15/16.70 [2019-03-28 12:03:17,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 30.15/16.70 [2019-03-28 12:03:17,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 30.15/16.70 [2019-03-28 12:03:17,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 30.15/16.70 [2019-03-28 12:03:17,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 30.15/16.70 [2019-03-28 12:03:17,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized 30.15/16.70 [2019-03-28 12:03:17,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 [2019-03-28 12:03:17,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 30.15/16.70 [2019-03-28 12:03:17,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 30.15/16.70 [2019-03-28 12:03:17,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... 30.15/16.70 [2019-03-28 12:03:17,868 INFO L276 PluginConnector]: RCFGBuilder initialized 30.15/16.70 [2019-03-28 12:03:17,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (1/1) ... 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.15/16.70 [2019-03-28 12:03:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 30.15/16.70 [2019-03-28 12:03:17,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 30.15/16.70 [2019-03-28 12:03:18,059 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 30.15/16.70 [2019-03-28 12:03:18,059 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 30.15/16.70 [2019-03-28 12:03:18,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:18 BoogieIcfgContainer 30.15/16.70 [2019-03-28 12:03:18,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 30.15/16.70 [2019-03-28 12:03:18,061 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 30.15/16.70 [2019-03-28 12:03:18,062 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 30.15/16.70 [2019-03-28 12:03:18,063 INFO L276 PluginConnector]: BlockEncodingV2 initialized 30.15/16.70 [2019-03-28 12:03:18,064 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:18" (1/1) ... 30.15/16.70 [2019-03-28 12:03:18,078 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 10 edges 30.15/16.70 [2019-03-28 12:03:18,080 INFO L258 BlockEncoder]: Using Remove infeasible edges 30.15/16.70 [2019-03-28 12:03:18,080 INFO L263 BlockEncoder]: Using Maximize final states 30.15/16.70 [2019-03-28 12:03:18,081 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 30.15/16.70 [2019-03-28 12:03:18,081 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 30.15/16.70 [2019-03-28 12:03:18,083 INFO L296 BlockEncoder]: Using Remove sink states 30.15/16.70 [2019-03-28 12:03:18,084 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 30.15/16.70 [2019-03-28 12:03:18,084 INFO L179 BlockEncoder]: Using Rewrite not-equals 30.15/16.70 [2019-03-28 12:03:18,099 INFO L185 BlockEncoder]: Using Use SBE 30.15/16.70 [2019-03-28 12:03:18,114 INFO L200 BlockEncoder]: SBE split 2 edges 30.15/16.70 [2019-03-28 12:03:18,119 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 30.15/16.70 [2019-03-28 12:03:18,120 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.15/16.70 [2019-03-28 12:03:18,128 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 30.15/16.70 [2019-03-28 12:03:18,130 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 30.15/16.70 [2019-03-28 12:03:18,132 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.15/16.70 [2019-03-28 12:03:18,132 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.15/16.70 [2019-03-28 12:03:18,132 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 30.15/16.70 [2019-03-28 12:03:18,132 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.15/16.70 [2019-03-28 12:03:18,133 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 30.15/16.70 [2019-03-28 12:03:18,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:18 BasicIcfg 30.15/16.70 [2019-03-28 12:03:18,133 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 30.15/16.70 [2019-03-28 12:03:18,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 30.15/16.70 [2019-03-28 12:03:18,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... 30.15/16.70 [2019-03-28 12:03:18,137 INFO L276 PluginConnector]: TraceAbstraction initialized 30.15/16.70 [2019-03-28 12:03:18,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:03:17" (1/4) ... 30.15/16.70 [2019-03-28 12:03:18,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261f9432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (2/4) ... 30.15/16.70 [2019-03-28 12:03:18,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261f9432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:18" (3/4) ... 30.15/16.70 [2019-03-28 12:03:18,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261f9432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:18" (4/4) ... 30.15/16.70 [2019-03-28 12:03:18,141 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.15/16.70 [2019-03-28 12:03:18,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 30.15/16.70 [2019-03-28 12:03:18,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 30.15/16.70 [2019-03-28 12:03:18,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 30.15/16.70 [2019-03-28 12:03:18,203 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.15/16.70 [2019-03-28 12:03:18,203 INFO L382 AbstractCegarLoop]: Interprodecural is true 30.15/16.70 [2019-03-28 12:03:18,203 INFO L383 AbstractCegarLoop]: Hoare is true 30.15/16.70 [2019-03-28 12:03:18,204 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 30.15/16.70 [2019-03-28 12:03:18,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 30.15/16.70 [2019-03-28 12:03:18,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.15/16.70 [2019-03-28 12:03:18,204 INFO L387 AbstractCegarLoop]: Difference is false 30.15/16.70 [2019-03-28 12:03:18,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 30.15/16.70 [2019-03-28 12:03:18,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 30.15/16.70 [2019-03-28 12:03:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 30.15/16.70 [2019-03-28 12:03:18,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 30.15/16.70 [2019-03-28 12:03:18,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 30.15/16.70 [2019-03-28 12:03:18,277 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 30.15/16.70 [2019-03-28 12:03:18,277 INFO L451 ceAbstractionStarter]: At program point L22-1(lines 19 24) the Hoare annotation is: true 30.15/16.70 [2019-03-28 12:03:18,277 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 21) no Hoare annotation was computed. 30.15/16.70 [2019-03-28 12:03:18,278 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 19 24) no Hoare annotation was computed. 30.15/16.70 [2019-03-28 12:03:18,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:18 BasicIcfg 30.15/16.70 [2019-03-28 12:03:18,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 30.15/16.70 [2019-03-28 12:03:18,286 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 30.15/16.70 [2019-03-28 12:03:18,286 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 30.15/16.70 [2019-03-28 12:03:18,290 INFO L276 PluginConnector]: BuchiAutomizer initialized 30.15/16.70 [2019-03-28 12:03:18,290 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.15/16.70 [2019-03-28 12:03:18,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:03:17" (1/5) ... 30.15/16.70 [2019-03-28 12:03:18,291 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29497a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,291 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.15/16.70 [2019-03-28 12:03:18,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:03:17" (2/5) ... 30.15/16.70 [2019-03-28 12:03:18,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29497a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.15/16.70 [2019-03-28 12:03:18,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:03:18" (3/5) ... 30.15/16.70 [2019-03-28 12:03:18,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29497a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,293 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.15/16.70 [2019-03-28 12:03:18,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:03:18" (4/5) ... 30.15/16.70 [2019-03-28 12:03:18,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29497a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:18, skipping insertion in model container 30.15/16.70 [2019-03-28 12:03:18,294 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.15/16.70 [2019-03-28 12:03:18,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:03:18" (5/5) ... 30.15/16.70 [2019-03-28 12:03:18,295 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.15/16.70 [2019-03-28 12:03:18,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.15/16.70 [2019-03-28 12:03:18,322 INFO L374 BuchiCegarLoop]: Interprodecural is true 30.15/16.70 [2019-03-28 12:03:18,322 INFO L375 BuchiCegarLoop]: Hoare is true 30.15/16.70 [2019-03-28 12:03:18,323 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 30.15/16.70 [2019-03-28 12:03:18,323 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 30.15/16.70 [2019-03-28 12:03:18,323 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.15/16.70 [2019-03-28 12:03:18,323 INFO L379 BuchiCegarLoop]: Difference is false 30.15/16.70 [2019-03-28 12:03:18,323 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 30.15/16.70 [2019-03-28 12:03:18,323 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 30.15/16.70 [2019-03-28 12:03:18,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 30.15/16.70 [2019-03-28 12:03:18,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.70 [2019-03-28 12:03:18,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.70 [2019-03-28 12:03:18,345 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.70 [2019-03-28 12:03:18,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.15/16.70 [2019-03-28 12:03:18,353 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.70 [2019-03-28 12:03:18,353 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 30.15/16.70 [2019-03-28 12:03:18,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 30.15/16.70 [2019-03-28 12:03:18,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.70 [2019-03-28 12:03:18,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.70 [2019-03-28 12:03:18,354 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.70 [2019-03-28 12:03:18,354 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.15/16.70 [2019-03-28 12:03:18,354 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.70 [2019-03-28 12:03:18,359 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L22-1true 30.15/16.70 [2019-03-28 12:03:18,360 INFO L796 eck$LassoCheckResult]: Loop: 3#L22-1true [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 6#L20true [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 5#L20-2true [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 3#L22-1true 30.15/16.70 [2019-03-28 12:03:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:18,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:18,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 59771, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:18,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:18,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1877022, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:18,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:18,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:18,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:18,574 INFO L216 LassoAnalysis]: Preferences: 30.15/16.70 [2019-03-28 12:03:18,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.70 [2019-03-28 12:03:18,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.70 [2019-03-28 12:03:18,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.70 [2019-03-28 12:03:18,576 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.70 [2019-03-28 12:03:18,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:18,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.70 [2019-03-28 12:03:18,576 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.70 [2019-03-28 12:03:18,577 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.15/16.70 [2019-03-28 12:03:18,577 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.70 [2019-03-28 12:03:18,577 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.70 [2019-03-28 12:03:18,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:18,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:18,719 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.70 [2019-03-28 12:03:18,720 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:18,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.70 [2019-03-28 12:03:18,728 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:18,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.70 [2019-03-28 12:03:18,764 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.70 [2019-03-28 12:03:18,804 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.70 [2019-03-28 12:03:18,806 INFO L216 LassoAnalysis]: Preferences: 30.15/16.70 [2019-03-28 12:03:18,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.70 [2019-03-28 12:03:18,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.70 [2019-03-28 12:03:18,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.70 [2019-03-28 12:03:18,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.70 [2019-03-28 12:03:18,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:18,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.70 [2019-03-28 12:03:18,807 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.70 [2019-03-28 12:03:18,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.15/16.70 [2019-03-28 12:03:18,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.70 [2019-03-28 12:03:18,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.70 [2019-03-28 12:03:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:18,878 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.70 [2019-03-28 12:03:18,884 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.70 [2019-03-28 12:03:18,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.70 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.70 Number of strict supporting invariants: 0 30.15/16.70 Number of non-strict supporting invariants: 1 30.15/16.70 Consider only non-deceasing supporting invariants: true 30.15/16.70 Simplify termination arguments: true 30.15/16.70 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.70 [2019-03-28 12:03:18,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.70 [2019-03-28 12:03:18,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.70 [2019-03-28 12:03:18,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.70 [2019-03-28 12:03:18,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.70 [2019-03-28 12:03:18,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.70 [2019-03-28 12:03:18,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.70 [2019-03-28 12:03:18,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.70 [2019-03-28 12:03:18,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.15/16.70 [2019-03-28 12:03:18,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.70 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.70 Number of strict supporting invariants: 0 30.15/16.70 Number of non-strict supporting invariants: 1 30.15/16.70 Consider only non-deceasing supporting invariants: true 30.15/16.70 Simplify termination arguments: true 30.15/16.70 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.70 [2019-03-28 12:03:18,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.70 [2019-03-28 12:03:18,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.70 [2019-03-28 12:03:18,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.70 [2019-03-28 12:03:18,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.70 [2019-03-28 12:03:18,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.70 [2019-03-28 12:03:18,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.70 [2019-03-28 12:03:18,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.70 [2019-03-28 12:03:18,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.70 [2019-03-28 12:03:18,918 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.70 [2019-03-28 12:03:18,918 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.70 [2019-03-28 12:03:18,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.70 [2019-03-28 12:03:18,920 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.70 [2019-03-28 12:03:18,920 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.70 [2019-03-28 12:03:18,921 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.70 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 30.15/16.70 Supporting invariants [] 30.15/16.70 [2019-03-28 12:03:18,922 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.70 [2019-03-28 12:03:18,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:18,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.70 [2019-03-28 12:03:18,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.70 [2019-03-28 12:03:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:18,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 30.15/16.70 [2019-03-28 12:03:18,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.70 [2019-03-28 12:03:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.70 [2019-03-28 12:03:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,059 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.70 [2019-03-28 12:03:19,060 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 30.15/16.70 [2019-03-28 12:03:19,065 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 30.15/16.70 [2019-03-28 12:03:19,067 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 4 states. 30.15/16.70 [2019-03-28 12:03:19,189 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 4 states. Result 13 states and 26 transitions. Complement of second has 10 states. 30.15/16.70 [2019-03-28 12:03:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 30.15/16.70 [2019-03-28 12:03:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.15/16.70 [2019-03-28 12:03:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 30.15/16.70 [2019-03-28 12:03:19,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. 30.15/16.70 [2019-03-28 12:03:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 30.15/16.70 [2019-03-28 12:03:19,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. 30.15/16.70 [2019-03-28 12:03:19,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 26 transitions. 30.15/16.70 [2019-03-28 12:03:19,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.70 [2019-03-28 12:03:19,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 30.15/16.70 [2019-03-28 12:03:19,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 30.15/16.70 [2019-03-28 12:03:19,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.70 [2019-03-28 12:03:19,212 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 30.15/16.70 [2019-03-28 12:03:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 30.15/16.70 [2019-03-28 12:03:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,243 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,243 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,243 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 30.15/16.70 [2019-03-28 12:03:19,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.70 [2019-03-28 12:03:19,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.70 [2019-03-28 12:03:19,245 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.70 [2019-03-28 12:03:19,245 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 30.15/16.70 [2019-03-28 12:03:19,245 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.70 [2019-03-28 12:03:19,246 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 73#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 71#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 74#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L22-1 30.15/16.70 [2019-03-28 12:03:19,246 INFO L796 eck$LassoCheckResult]: Loop: 67#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 68#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 76#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 67#L22-1 30.15/16.70 [2019-03-28 12:03:19,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1877125, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:19,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 59771, now seen corresponding path program 2 times 30.15/16.70 [2019-03-28 12:03:19,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash 86886007, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:19,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:19,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.70 [2019-03-28 12:03:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.15/16.70 [2019-03-28 12:03:19,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.15/16.70 [2019-03-28 12:03:19,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:19,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core 30.15/16.70 [2019-03-28 12:03:19,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.70 [2019-03-28 12:03:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.70 [2019-03-28 12:03:19,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 30.15/16.70 [2019-03-28 12:03:19,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 30.15/16.70 [2019-03-28 12:03:19,558 INFO L216 LassoAnalysis]: Preferences: 30.15/16.70 [2019-03-28 12:03:19,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.70 [2019-03-28 12:03:19,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.70 [2019-03-28 12:03:19,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.70 [2019-03-28 12:03:19,559 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.70 [2019-03-28 12:03:19,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:19,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.70 [2019-03-28 12:03:19,560 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.70 [2019-03-28 12:03:19,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.15/16.70 [2019-03-28 12:03:19,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.70 [2019-03-28 12:03:19,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.70 [2019-03-28 12:03:19,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:19,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:19,640 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.70 [2019-03-28 12:03:19,641 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:19,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.70 [2019-03-28 12:03:19,650 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.70 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.70 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.70 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:19,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.70 [2019-03-28 12:03:19,685 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.70 [2019-03-28 12:03:19,721 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.70 [2019-03-28 12:03:19,723 INFO L216 LassoAnalysis]: Preferences: 30.15/16.70 [2019-03-28 12:03:19,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.70 [2019-03-28 12:03:19,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.70 [2019-03-28 12:03:19,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.70 [2019-03-28 12:03:19,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.70 [2019-03-28 12:03:19,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:19,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.70 [2019-03-28 12:03:19,724 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.70 [2019-03-28 12:03:19,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.15/16.70 [2019-03-28 12:03:19,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.70 [2019-03-28 12:03:19,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.70 [2019-03-28 12:03:19,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:19,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:19,785 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.70 [2019-03-28 12:03:19,785 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.70 [2019-03-28 12:03:19,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.70 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.70 Number of strict supporting invariants: 0 30.15/16.70 Number of non-strict supporting invariants: 1 30.15/16.70 Consider only non-deceasing supporting invariants: true 30.15/16.70 Simplify termination arguments: true 30.15/16.70 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.70 [2019-03-28 12:03:19,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.70 [2019-03-28 12:03:19,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.70 [2019-03-28 12:03:19,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.70 [2019-03-28 12:03:19,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.70 [2019-03-28 12:03:19,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.70 [2019-03-28 12:03:19,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.70 [2019-03-28 12:03:19,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.70 [2019-03-28 12:03:19,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.70 [2019-03-28 12:03:19,801 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.70 [2019-03-28 12:03:19,801 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.70 [2019-03-28 12:03:19,802 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.70 [2019-03-28 12:03:19,802 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.70 [2019-03-28 12:03:19,802 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.70 [2019-03-28 12:03:19,802 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.70 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 30.15/16.70 Supporting invariants [] 30.15/16.70 [2019-03-28 12:03:19,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.70 [2019-03-28 12:03:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:19,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.70 [2019-03-28 12:03:19,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.70 [2019-03-28 12:03:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.70 [2019-03-28 12:03:19,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 30.15/16.70 [2019-03-28 12:03:19,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.70 [2019-03-28 12:03:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.70 [2019-03-28 12:03:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:19,900 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.70 [2019-03-28 12:03:19,900 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 30.15/16.70 [2019-03-28 12:03:19,900 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 30.15/16.70 [2019-03-28 12:03:19,901 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10 Second operand 4 states. 30.15/16.70 [2019-03-28 12:03:19,986 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 33 states and 63 transitions. Complement of second has 20 states. 30.15/16.70 [2019-03-28 12:03:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 30.15/16.70 [2019-03-28 12:03:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.15/16.70 [2019-03-28 12:03:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 30.15/16.70 [2019-03-28 12:03:19,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 30.15/16.70 [2019-03-28 12:03:19,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 7 letters. Loop has 3 letters. 30.15/16.70 [2019-03-28 12:03:19,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 6 letters. 30.15/16.70 [2019-03-28 12:03:19,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.70 [2019-03-28 12:03:19,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 63 transitions. 30.15/16.70 [2019-03-28 12:03:19,993 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 30.15/16.70 [2019-03-28 12:03:19,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 46 transitions. 30.15/16.70 [2019-03-28 12:03:19,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 30.15/16.70 [2019-03-28 12:03:19,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 30.15/16.70 [2019-03-28 12:03:19,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 46 transitions. 30.15/16.70 [2019-03-28 12:03:19,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.70 [2019-03-28 12:03:19,995 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 30.15/16.70 [2019-03-28 12:03:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 46 transitions. 30.15/16.70 [2019-03-28 12:03:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 10. 30.15/16.70 [2019-03-28 12:03:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 30.15/16.70 [2019-03-28 12:03:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,997 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 30.15/16.70 [2019-03-28 12:03:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 30.15/16.70 [2019-03-28 12:03:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 30.15/16.70 [2019-03-28 12:03:20,001 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 8 states. 30.15/16.70 [2019-03-28 12:03:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.15/16.70 [2019-03-28 12:03:20,132 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 30.15/16.70 [2019-03-28 12:03:20,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 30.15/16.70 [2019-03-28 12:03:20,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 30.15/16.70 [2019-03-28 12:03:20,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 30.15/16.70 [2019-03-28 12:03:20,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.70 [2019-03-28 12:03:20,137 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. 30.15/16.70 [2019-03-28 12:03:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. 30.15/16.70 [2019-03-28 12:03:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 30.15/16.70 [2019-03-28 12:03:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. 30.15/16.70 [2019-03-28 12:03:20,140 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 30.15/16.70 [2019-03-28 12:03:20,140 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 30.15/16.70 [2019-03-28 12:03:20,140 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 30.15/16.70 [2019-03-28 12:03:20,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. 30.15/16.70 [2019-03-28 12:03:20,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 30.15/16.70 [2019-03-28 12:03:20,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.70 [2019-03-28 12:03:20,141 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.70 [2019-03-28 12:03:20,141 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 30.15/16.70 [2019-03-28 12:03:20,141 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.70 [2019-03-28 12:03:20,141 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L22-1 30.15/16.70 [2019-03-28 12:03:20,142 INFO L796 eck$LassoCheckResult]: Loop: 247#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 245#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 254#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 247#L22-1 30.15/16.70 [2019-03-28 12:03:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times 30.15/16.70 [2019-03-28 12:03:20,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:20,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:20,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:20,148 INFO L82 PathProgramCache]: Analyzing trace with hash 59781, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:20,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:20,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:20,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.70 [2019-03-28 12:03:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1877032, now seen corresponding path program 1 times 30.15/16.70 [2019-03-28 12:03:20,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.70 [2019-03-28 12:03:20,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.70 [2019-03-28 12:03:20,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.70 [2019-03-28 12:03:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.70 [2019-03-28 12:03:20,211 INFO L216 LassoAnalysis]: Preferences: 30.15/16.70 [2019-03-28 12:03:20,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.70 [2019-03-28 12:03:20,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.70 [2019-03-28 12:03:20,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.70 [2019-03-28 12:03:20,211 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.70 [2019-03-28 12:03:20,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.70 [2019-03-28 12:03:20,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.70 [2019-03-28 12:03:20,212 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.70 [2019-03-28 12:03:20,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.15/16.70 [2019-03-28 12:03:20,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.70 [2019-03-28 12:03:20,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.70 [2019-03-28 12:03:20,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.70 [2019-03-28 12:03:20,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:20,260 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:20,260 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,265 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:20,294 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.15/16.71 [2019-03-28 12:03:20,295 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,319 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,352 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:20,551 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.71 [2019-03-28 12:03:20,554 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:20,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:20,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:20,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:20,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.71 [2019-03-28 12:03:20,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:20,555 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:20,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.15/16.71 [2019-03-28 12:03:20,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:20,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:20,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:20,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:20,604 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:20,604 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.71 [2019-03-28 12:03:20,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:20,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:20,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:20,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:20,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:20,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:20,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:20,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:20,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.15/16.71 [2019-03-28 12:03:20,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:20,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:20,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:20,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:20,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:20,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:20,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:20,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:20,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.71 [2019-03-28 12:03:20,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.71 [2019-03-28 12:03:20,623 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.71 [2019-03-28 12:03:20,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.71 [2019-03-28 12:03:20,623 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.71 [2019-03-28 12:03:20,623 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.71 [2019-03-28 12:03:20,624 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.71 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 30.15/16.71 Supporting invariants [] 30.15/16.71 [2019-03-28 12:03:20,624 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.71 [2019-03-28 12:03:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:20,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:20,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:20,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:20,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,703 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.71 [2019-03-28 12:03:20,703 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 30.15/16.71 [2019-03-28 12:03:20,703 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 30.15/16.71 [2019-03-28 12:03:20,703 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13 Second operand 4 states. 30.15/16.71 [2019-03-28 12:03:20,794 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 70 states and 121 transitions. Complement of second has 10 states. 30.15/16.71 [2019-03-28 12:03:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 30.15/16.71 [2019-03-28 12:03:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.15/16.71 [2019-03-28 12:03:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 30.15/16.71 [2019-03-28 12:03:20,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:20,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:20,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:20,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:20,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:20,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:20,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 121 transitions. 30.15/16.71 [2019-03-28 12:03:20,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 30.15/16.71 [2019-03-28 12:03:20,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 48 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:20,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 30.15/16.71 [2019-03-28 12:03:20,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 30.15/16.71 [2019-03-28 12:03:20,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:20,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.71 [2019-03-28 12:03:20,804 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 24. 30.15/16.71 [2019-03-28 12:03:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 30.15/16.71 [2019-03-28 12:03:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. 30.15/16.71 [2019-03-28 12:03:20,807 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. 30.15/16.71 [2019-03-28 12:03:20,807 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 43 transitions. 30.15/16.71 [2019-03-28 12:03:20,808 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 30.15/16.71 [2019-03-28 12:03:20,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 43 transitions. 30.15/16.71 [2019-03-28 12:03:20,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 30.15/16.71 [2019-03-28 12:03:20,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.71 [2019-03-28 12:03:20,809 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.71 [2019-03-28 12:03:20,809 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 30.15/16.71 [2019-03-28 12:03:20,809 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.71 [2019-03-28 12:03:20,810 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 381#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 391#L20 30.15/16.71 [2019-03-28 12:03:20,810 INFO L796 eck$LassoCheckResult]: Loop: 391#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 394#L20-2 [44] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 393#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 391#L20 30.15/16.71 [2019-03-28 12:03:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:20,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:20,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:20,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 68664, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:20,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash 58190905, now seen corresponding path program 2 times 30.15/16.71 [2019-03-28 12:03:20,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:20,875 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:20,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:20,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:20,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:20,876 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.71 [2019-03-28 12:03:20,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:20,876 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:20,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.15/16.71 [2019-03-28 12:03:20,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:20,877 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:20,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:20,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:20,922 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:20,922 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,927 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:20,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.15/16.71 [2019-03-28 12:03:20,954 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,959 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:20,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:20,990 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:21,264 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.71 [2019-03-28 12:03:21,267 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:21,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:21,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:21,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:21,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.71 [2019-03-28 12:03:21,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:21,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:21,268 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:21,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.15/16.71 [2019-03-28 12:03:21,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:21,268 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:21,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:21,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:21,318 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:21,318 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.71 [2019-03-28 12:03:21,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:21,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:21,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:21,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:21,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:21,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:21,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:21,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:21,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.15/16.71 [2019-03-28 12:03:21,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:21,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:21,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:21,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:21,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:21,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:21,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:21,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:21,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.71 [2019-03-28 12:03:21,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.71 [2019-03-28 12:03:21,335 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.71 [2019-03-28 12:03:21,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.71 [2019-03-28 12:03:21,336 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.71 [2019-03-28 12:03:21,336 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.71 [2019-03-28 12:03:21,336 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.71 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 30.15/16.71 Supporting invariants [] 30.15/16.71 [2019-03-28 12:03:21,336 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.71 [2019-03-28 12:03:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:21,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:21,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:21,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:21,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:21,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:21,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:21,433 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 30.15/16.71 [2019-03-28 12:03:21,433 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 30.15/16.71 [2019-03-28 12:03:21,433 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21 Second operand 4 states. 30.15/16.71 [2019-03-28 12:03:21,557 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 43 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 107 states and 184 transitions. Complement of second has 21 states. 30.15/16.71 [2019-03-28 12:03:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states 30.15/16.71 [2019-03-28 12:03:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.15/16.71 [2019-03-28 12:03:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. 30.15/16.71 [2019-03-28 12:03:21,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:21,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:21,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:21,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:21,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:21,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:21,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 184 transitions. 30.15/16.71 [2019-03-28 12:03:21,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 30.15/16.71 [2019-03-28 12:03:21,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 50 states and 82 transitions. 30.15/16.71 [2019-03-28 12:03:21,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 30.15/16.71 [2019-03-28 12:03:21,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 30.15/16.71 [2019-03-28 12:03:21,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 82 transitions. 30.15/16.71 [2019-03-28 12:03:21,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.71 [2019-03-28 12:03:21,567 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 82 transitions. 30.15/16.71 [2019-03-28 12:03:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 82 transitions. 30.15/16.71 [2019-03-28 12:03:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. 30.15/16.71 [2019-03-28 12:03:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 30.15/16.71 [2019-03-28 12:03:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. 30.15/16.71 [2019-03-28 12:03:21,570 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 30.15/16.71 [2019-03-28 12:03:21,570 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 46 transitions. 30.15/16.71 [2019-03-28 12:03:21,570 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 30.15/16.71 [2019-03-28 12:03:21,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 46 transitions. 30.15/16.71 [2019-03-28 12:03:21,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 30.15/16.71 [2019-03-28 12:03:21,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.71 [2019-03-28 12:03:21,571 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.71 [2019-03-28 12:03:21,572 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 30.15/16.71 [2019-03-28 12:03:21,572 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 30.15/16.71 [2019-03-28 12:03:21,572 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 578#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 579#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 595#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 596#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L20 30.15/16.71 [2019-03-28 12:03:21,572 INFO L796 eck$LassoCheckResult]: Loop: 591#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 585#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 586#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 593#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 600#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 594#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 591#L20 30.15/16.71 [2019-03-28 12:03:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 58187991, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:21,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:21,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1950482520, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:21,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:21,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1858562222, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:21,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:21,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.15/16.71 [2019-03-28 12:03:21,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.15/16.71 [2019-03-28 12:03:21,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:21,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:21,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:21,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 30.15/16.71 [2019-03-28 12:03:21,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 30.15/16.71 [2019-03-28 12:03:21,831 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:21,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:21,832 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:21,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:21,832 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.71 [2019-03-28 12:03:21,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:21,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:21,832 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:21,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 30.15/16.71 [2019-03-28 12:03:21,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:21,833 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:21,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:21,890 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:21,890 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:21,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:21,894 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:21,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:21,927 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:22,395 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.71 [2019-03-28 12:03:22,400 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:22,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:22,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:22,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:22,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.71 [2019-03-28 12:03:22,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:22,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:22,401 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:22,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 30.15/16.71 [2019-03-28 12:03:22,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:22,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:22,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:22,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:22,451 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:22,451 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.71 [2019-03-28 12:03:22,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:22,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:22,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:22,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:22,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:22,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:22,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:22,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:22,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.71 [2019-03-28 12:03:22,463 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.71 [2019-03-28 12:03:22,464 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. 30.15/16.71 [2019-03-28 12:03:22,464 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.71 [2019-03-28 12:03:22,464 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.71 [2019-03-28 12:03:22,464 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.71 [2019-03-28 12:03:22,464 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.71 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 30.15/16.71 Supporting invariants [] 30.15/16.71 [2019-03-28 12:03:22,465 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.71 [2019-03-28 12:03:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:22,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:22,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:22,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:22,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:22,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:22,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:22,655 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.71 [2019-03-28 12:03:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:22,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:22,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:22,730 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 13 predicates after loop cannibalization 30.15/16.71 [2019-03-28 12:03:22,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates 30.15/16.71 [2019-03-28 12:03:22,731 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23 Second operand 6 states. 30.15/16.71 [2019-03-28 12:03:23,478 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 46 transitions. cyclomatic complexity: 23. Second operand 6 states. Result 504 states and 785 transitions. Complement of second has 156 states. 30.15/16.71 [2019-03-28 12:03:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 17 non-accepting loop states 2 accepting loop states 30.15/16.71 [2019-03-28 12:03:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 30.15/16.71 [2019-03-28 12:03:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. 30.15/16.71 [2019-03-28 12:03:23,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:23,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:23,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 11 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:23,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:23,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 52 transitions. Stem has 5 letters. Loop has 12 letters. 30.15/16.71 [2019-03-28 12:03:23,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:23,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 504 states and 785 transitions. 30.15/16.71 [2019-03-28 12:03:23,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 30.15/16.71 [2019-03-28 12:03:23,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 504 states to 67 states and 94 transitions. 30.15/16.71 [2019-03-28 12:03:23,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 30.15/16.71 [2019-03-28 12:03:23,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 30.15/16.71 [2019-03-28 12:03:23,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 94 transitions. 30.15/16.71 [2019-03-28 12:03:23,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.71 [2019-03-28 12:03:23,497 INFO L706 BuchiCegarLoop]: Abstraction has 67 states and 94 transitions. 30.15/16.71 [2019-03-28 12:03:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 94 transitions. 30.15/16.71 [2019-03-28 12:03:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 27. 30.15/16.71 [2019-03-28 12:03:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 30.15/16.71 [2019-03-28 12:03:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,500 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 30.15/16.71 [2019-03-28 12:03:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 30.15/16.71 [2019-03-28 12:03:23,501 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 8 states. 30.15/16.71 [2019-03-28 12:03:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.15/16.71 [2019-03-28 12:03:23,579 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 30.15/16.71 [2019-03-28 12:03:23,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 30.15/16.71 [2019-03-28 12:03:23,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 30.15/16.71 [2019-03-28 12:03:23,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 30.15/16.71 [2019-03-28 12:03:23,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.71 [2019-03-28 12:03:23,583 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 59 transitions. 30.15/16.71 [2019-03-28 12:03:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. 30.15/16.71 [2019-03-28 12:03:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 30.15/16.71 [2019-03-28 12:03:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,586 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,586 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,586 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 30.15/16.71 [2019-03-28 12:03:23,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. 30.15/16.71 [2019-03-28 12:03:23,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 30.15/16.71 [2019-03-28 12:03:23,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.71 [2019-03-28 12:03:23,587 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.71 [2019-03-28 12:03:23,587 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] 30.15/16.71 [2019-03-28 12:03:23,587 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] 30.15/16.71 [2019-03-28 12:03:23,588 INFO L794 eck$LassoCheckResult]: Stem: 1525#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1518#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1520#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1530#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1537#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1533#L20 30.15/16.71 [2019-03-28 12:03:23,588 INFO L796 eck$LassoCheckResult]: Loop: 1533#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1534#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1535#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1536#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1530#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1537#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1533#L20 30.15/16.71 [2019-03-28 12:03:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 58190874, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:23,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:23,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2036369973, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:23,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:23,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:23,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash 817053582, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:23,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:23,688 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:23,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:23,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:23,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:23,688 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.71 [2019-03-28 12:03:23,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:23,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:23,689 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:23,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 30.15/16.71 [2019-03-28 12:03:23,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:23,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:23,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:23,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:23,751 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:23,751 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:23,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:23,761 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:23,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:23,791 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:24,217 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.71 [2019-03-28 12:03:24,221 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:24,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:24,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:24,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:24,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.71 [2019-03-28 12:03:24,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:24,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:24,222 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:24,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 30.15/16.71 [2019-03-28 12:03:24,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:24,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:24,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:24,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:24,270 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:24,270 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.71 [2019-03-28 12:03:24,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:24,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:24,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:24,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:24,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:24,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:24,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:24,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:24,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.71 [2019-03-28 12:03:24,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.71 [2019-03-28 12:03:24,279 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.71 [2019-03-28 12:03:24,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.71 [2019-03-28 12:03:24,279 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.71 [2019-03-28 12:03:24,279 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.71 [2019-03-28 12:03:24,280 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.71 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 30.15/16.71 Supporting invariants [] 30.15/16.71 [2019-03-28 12:03:24,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.71 [2019-03-28 12:03:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:24,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:24,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:24,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:24,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,352 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.71 [2019-03-28 12:03:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,359 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.71 [2019-03-28 12:03:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,367 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.15/16.71 [2019-03-28 12:03:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:24,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:24,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:24,421 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 30.15/16.71 [2019-03-28 12:03:24,422 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 30.15/16.71 [2019-03-28 12:03:24,422 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15 Second operand 6 states. 30.15/16.71 [2019-03-28 12:03:24,608 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 40 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 87 states and 131 transitions. Complement of second has 22 states. 30.15/16.71 [2019-03-28 12:03:24,608 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 30.15/16.71 [2019-03-28 12:03:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 30.15/16.71 [2019-03-28 12:03:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. 30.15/16.71 [2019-03-28 12:03:24,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:24,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. 30.15/16.71 [2019-03-28 12:03:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:24,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 131 transitions. 30.15/16.71 [2019-03-28 12:03:24,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.71 [2019-03-28 12:03:24,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 56 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:24,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 30.15/16.71 [2019-03-28 12:03:24,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 30.15/16.71 [2019-03-28 12:03:24,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:24,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.15/16.71 [2019-03-28 12:03:24,615 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 84 transitions. 30.15/16.71 [2019-03-28 12:03:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. 30.15/16.71 [2019-03-28 12:03:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 30.15/16.71 [2019-03-28 12:03:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. 30.15/16.71 [2019-03-28 12:03:24,618 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 63 transitions. 30.15/16.71 [2019-03-28 12:03:24,619 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 63 transitions. 30.15/16.71 [2019-03-28 12:03:24,619 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 30.15/16.71 [2019-03-28 12:03:24,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 63 transitions. 30.15/16.71 [2019-03-28 12:03:24,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 30.15/16.71 [2019-03-28 12:03:24,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.15/16.71 [2019-03-28 12:03:24,620 INFO L119 BuchiIsEmpty]: Starting construction of run 30.15/16.71 [2019-03-28 12:03:24,620 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] 30.15/16.71 [2019-03-28 12:03:24,620 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.15/16.71 [2019-03-28 12:03:24,620 INFO L794 eck$LassoCheckResult]: Stem: 1748#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1741#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1744#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1760#L20-2 [43] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~z~0_5 (- 1))) (= v_ULTIMATE.start_main_~y~0_6 (+ v_ULTIMATE.start_main_~y~0_7 v_ULTIMATE.start_main_~x~0_7)) (= v_ULTIMATE.start_main_~z~0_4 (+ v_ULTIMATE.start_main_~z~0_5 v_ULTIMATE.start_main_~y~0_6)) (> 0 |v_ULTIMATE.start_main_#t~nondet2_3|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_5, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_4, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1759#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1756#L20 [39] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~x~0_13) (>= v_ULTIMATE.start_main_~y~0_13 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1749#L20-2 30.15/16.71 [2019-03-28 12:03:24,621 INFO L796 eck$LassoCheckResult]: Loop: 1749#L20-2 [34] L20-2-->L22-1: Formula: (and (= v_ULTIMATE.start_main_~z~0_6 (+ v_ULTIMATE.start_main_~z~0_7 v_ULTIMATE.start_main_~x~0_8)) (= v_ULTIMATE.start_main_~y~0_8 (+ v_ULTIMATE.start_main_~z~0_7 (- 1))) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~x~0_9)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_6, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 1750#L22-1 [30] L22-1-->L20: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (< 0 v_ULTIMATE.start_main_~y~0_11)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_11, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[] 1755#L20 [36] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~z~0_8 v_ULTIMATE.start_main_~y~0_12) (< v_ULTIMATE.start_main_~y~0_12 v_ULTIMATE.start_main_~x~0_12)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_12, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0] 1749#L20-2 30.15/16.71 [2019-03-28 12:03:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1803827760, now seen corresponding path program 1 times 30.15/16.71 [2019-03-28 12:03:24,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:24,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash 63431, now seen corresponding path program 3 times 30.15/16.71 [2019-03-28 12:03:24,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash -797975752, now seen corresponding path program 2 times 30.15/16.71 [2019-03-28 12:03:24,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.15/16.71 [2019-03-28 12:03:24,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.15/16.71 [2019-03-28 12:03:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.15/16.71 [2019-03-28 12:03:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.15/16.71 [2019-03-28 12:03:24,694 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:24,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:24,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:24,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:24,695 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.15/16.71 [2019-03-28 12:03:24,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:24,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:24,695 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:24,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 30.15/16.71 [2019-03-28 12:03:24,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:24,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:24,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:24,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:24,750 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:24,750 INFO L412 LassoAnalysis]: Checking for nontermination... 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:24,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:24,754 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:24,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.15/16.71 [2019-03-28 12:03:24,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:24,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:24,786 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 30.15/16.71 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.15/16.71 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:24,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.15/16.71 [2019-03-28 12:03:24,819 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.15/16.71 [2019-03-28 12:03:29,681 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.15/16.71 [2019-03-28 12:03:29,685 INFO L216 LassoAnalysis]: Preferences: 30.15/16.71 [2019-03-28 12:03:29,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.15/16.71 [2019-03-28 12:03:29,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.15/16.71 [2019-03-28 12:03:29,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.15/16.71 [2019-03-28 12:03:29,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.15/16.71 [2019-03-28 12:03:29,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.15/16.71 [2019-03-28 12:03:29,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.15/16.71 [2019-03-28 12:03:29,686 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.15/16.71 [2019-03-28 12:03:29,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 30.15/16.71 [2019-03-28 12:03:29,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.15/16.71 [2019-03-28 12:03:29,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.15/16.71 [2019-03-28 12:03:29,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:29,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.15/16.71 [2019-03-28 12:03:29,732 INFO L300 LassoAnalysis]: Preprocessing complete. 30.15/16.71 [2019-03-28 12:03:29,732 INFO L497 LassoAnalysis]: Using template 'affine'. 30.15/16.71 [2019-03-28 12:03:29,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:29,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:29,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:29,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:29,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:29,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:29,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:29,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:29,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.15/16.71 [2019-03-28 12:03:29,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.15/16.71 Termination analysis: LINEAR_WITH_GUESSES 30.15/16.71 Number of strict supporting invariants: 0 30.15/16.71 Number of non-strict supporting invariants: 1 30.15/16.71 Consider only non-deceasing supporting invariants: true 30.15/16.71 Simplify termination arguments: true 30.15/16.71 Simplify supporting invariants: trueOverapproximate stem: false 30.15/16.71 [2019-03-28 12:03:29,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.15/16.71 [2019-03-28 12:03:29,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.15/16.71 [2019-03-28 12:03:29,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.15/16.71 [2019-03-28 12:03:29,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.15/16.71 [2019-03-28 12:03:29,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.15/16.71 [2019-03-28 12:03:29,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.15/16.71 [2019-03-28 12:03:29,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.15/16.71 [2019-03-28 12:03:29,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.15/16.71 [2019-03-28 12:03:29,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.15/16.71 [2019-03-28 12:03:29,742 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 30.15/16.71 [2019-03-28 12:03:29,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.15/16.71 [2019-03-28 12:03:29,743 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.15/16.71 [2019-03-28 12:03:29,743 INFO L518 LassoAnalysis]: Proved termination. 30.15/16.71 [2019-03-28 12:03:29,743 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.15/16.71 Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 30.15/16.71 Supporting invariants [] 30.15/16.71 [2019-03-28 12:03:29,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.15/16.71 [2019-03-28 12:03:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.15/16.71 [2019-03-28 12:03:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:29,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:29,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.15/16.71 [2019-03-28 12:03:29,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core 30.15/16.71 [2019-03-28 12:03:29,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.15/16.71 [2019-03-28 12:03:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.15/16.71 [2019-03-28 12:03:29,788 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 30.15/16.71 [2019-03-28 12:03:29,788 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 30.15/16.71 [2019-03-28 12:03:29,789 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. 30.15/16.71 [2019-03-28 12:03:29,841 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 61 states and 97 transitions. Complement of second has 7 states. 30.15/16.71 [2019-03-28 12:03:29,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 30.15/16.71 [2019-03-28 12:03:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.15/16.71 [2019-03-28 12:03:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. 30.15/16.71 [2019-03-28 12:03:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. 30.15/16.71 [2019-03-28 12:03:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. 30.15/16.71 [2019-03-28 12:03:29,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.15/16.71 [2019-03-28 12:03:29,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 97 transitions. 30.15/16.71 [2019-03-28 12:03:29,846 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.15/16.71 [2019-03-28 12:03:29,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 30.15/16.71 [2019-03-28 12:03:29,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 30.15/16.71 [2019-03-28 12:03:29,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.15/16.71 [2019-03-28 12:03:29,846 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,847 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,847 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,847 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 30.15/16.71 [2019-03-28 12:03:29,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 30.15/16.71 [2019-03-28 12:03:29,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.15/16.71 [2019-03-28 12:03:29,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 30.15/16.71 [2019-03-28 12:03:29,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:29 BasicIcfg 30.15/16.71 [2019-03-28 12:03:29,854 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 30.15/16.71 [2019-03-28 12:03:29,854 INFO L168 Benchmark]: Toolchain (without parser) took 12323.00 ms. Allocated memory was 649.6 MB in the beginning and 768.6 MB in the end (delta: 119.0 MB). Free memory was 564.8 MB in the beginning and 471.0 MB in the end (delta: 93.8 MB). Peak memory consumption was 212.8 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,856 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.93 ms. Allocated memory is still 649.6 MB. Free memory was 564.8 MB in the beginning and 555.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.51 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 555.3 MB in the beginning and 647.9 MB in the end (delta: -92.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,858 INFO L168 Benchmark]: Boogie Preprocessor took 19.60 ms. Allocated memory is still 681.6 MB. Free memory was 647.9 MB in the beginning and 646.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,858 INFO L168 Benchmark]: RCFGBuilder took 192.91 ms. Allocated memory is still 681.6 MB. Free memory was 646.1 MB in the beginning and 631.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,859 INFO L168 Benchmark]: BlockEncodingV2 took 71.88 ms. Allocated memory is still 681.6 MB. Free memory was 631.9 MB in the beginning and 626.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,859 INFO L168 Benchmark]: TraceAbstraction took 151.82 ms. Allocated memory is still 681.6 MB. Free memory was 625.4 MB in the beginning and 617.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,860 INFO L168 Benchmark]: BuchiAutomizer took 11567.63 ms. Allocated memory was 681.6 MB in the beginning and 768.6 MB in the end (delta: 87.0 MB). Free memory was 617.3 MB in the beginning and 471.0 MB in the end (delta: 146.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 50.3 GB. 30.15/16.71 [2019-03-28 12:03:29,864 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 30.15/16.71 --- Results --- 30.15/16.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 30.15/16.71 - StatisticsResult: Initial Icfg 30.15/16.71 7 locations, 10 edges 30.15/16.71 - StatisticsResult: Encoded RCFG 30.15/16.71 4 locations, 7 edges 30.15/16.71 * Results from de.uni_freiburg.informatik.ultimate.core: 30.15/16.71 - StatisticsResult: Toolchain Benchmarks 30.15/16.71 Benchmark results are: 30.15/16.71 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.15/16.71 * CACSL2BoogieTranslator took 224.93 ms. Allocated memory is still 649.6 MB. Free memory was 564.8 MB in the beginning and 555.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 30.15/16.71 * Boogie Procedure Inliner took 88.51 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 555.3 MB in the beginning and 647.9 MB in the end (delta: -92.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 30.15/16.71 * Boogie Preprocessor took 19.60 ms. Allocated memory is still 681.6 MB. Free memory was 647.9 MB in the beginning and 646.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. 30.15/16.71 * RCFGBuilder took 192.91 ms. Allocated memory is still 681.6 MB. Free memory was 646.1 MB in the beginning and 631.9 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 30.15/16.71 * BlockEncodingV2 took 71.88 ms. Allocated memory is still 681.6 MB. Free memory was 631.9 MB in the beginning and 626.7 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. 30.15/16.71 * TraceAbstraction took 151.82 ms. Allocated memory is still 681.6 MB. Free memory was 625.4 MB in the beginning and 617.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.15/16.71 * BuchiAutomizer took 11567.63 ms. Allocated memory was 681.6 MB in the beginning and 768.6 MB in the end (delta: 87.0 MB). Free memory was 617.3 MB in the beginning and 471.0 MB in the end (delta: 146.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 50.3 GB. 30.15/16.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 30.15/16.71 - AllSpecificationsHoldResult: All specifications hold 30.15/16.71 We were not able to verify any specifiation because the program does not contain any specification. 30.15/16.71 - InvariantResult [Line: 19]: Loop Invariant 30.15/16.71 Derived loop invariant: 1 30.15/16.71 - StatisticsResult: Ultimate Automizer benchmark data 30.15/16.71 CFG has 1 procedures, 4 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=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 30.15/16.71 - StatisticsResult: Constructed decomposition of program 30.15/16.71 Your program was decomposed into 9 terminating modules (2 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 21 locations. One nondeterministic module has affine ranking function x and consists of 11 locations. One nondeterministic module has affine ranking function z and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. 30.15/16.71 - StatisticsResult: Timing statistics 30.15/16.71 BüchiAutomizer plugin needed 11.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.4s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 140 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 36 SDtfs, 148 SDslu, 4 SDs, 0 SdLazy, 536 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp88 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq178 hnf92 smp100 dnf100 smp100 tf105 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 6.6s 30.15/16.71 - TerminationAnalysisResult: Termination proven 30.15/16.71 Buchi Automizer proved that your program is terminating 30.15/16.71 RESULT: Ultimate proved your program to be correct! 30.15/16.71 !SESSION 2019-03-28 12:03:14.302 ----------------------------------------------- 30.15/16.71 eclipse.buildId=unknown 30.15/16.71 java.version=1.8.0_181 30.15/16.71 java.vendor=Oracle Corporation 30.15/16.71 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 30.15/16.71 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 30.15/16.71 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 30.15/16.71 30.15/16.71 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:03:30.097 30.15/16.71 !MESSAGE The workspace will exit with unsaved changes in this session. 30.15/16.71 Received shutdown request... 30.15/16.71 Ultimate: 30.15/16.71 GTK+ Version Check 30.15/16.71 EOF