40.25/19.77 YES 40.25/19.77 40.25/19.77 Ultimate: Cannot open display: 40.25/19.77 This is Ultimate 0.1.24-8dc7c08-m 40.25/19.77 [2019-03-28 12:09:46,756 INFO L170 SettingsManager]: Resetting all preferences to default values... 40.25/19.77 [2019-03-28 12:09:46,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 40.25/19.77 [2019-03-28 12:09:46,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 40.25/19.77 [2019-03-28 12:09:46,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 40.25/19.77 [2019-03-28 12:09:46,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 40.25/19.77 [2019-03-28 12:09:46,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 40.25/19.77 [2019-03-28 12:09:46,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 40.25/19.77 [2019-03-28 12:09:46,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 40.25/19.77 [2019-03-28 12:09:46,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 40.25/19.77 [2019-03-28 12:09:46,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 40.25/19.77 [2019-03-28 12:09:46,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 40.25/19.77 [2019-03-28 12:09:46,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 40.25/19.77 [2019-03-28 12:09:46,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 40.25/19.77 [2019-03-28 12:09:46,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 40.25/19.77 [2019-03-28 12:09:46,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 40.25/19.77 [2019-03-28 12:09:46,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 40.25/19.77 [2019-03-28 12:09:46,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 40.25/19.77 [2019-03-28 12:09:46,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 40.25/19.77 [2019-03-28 12:09:46,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 40.25/19.77 [2019-03-28 12:09:46,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 40.25/19.77 [2019-03-28 12:09:46,793 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 40.25/19.77 [2019-03-28 12:09:46,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 40.25/19.77 [2019-03-28 12:09:46,794 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 40.25/19.77 [2019-03-28 12:09:46,795 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 40.25/19.77 [2019-03-28 12:09:46,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 40.25/19.77 [2019-03-28 12:09:46,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 40.25/19.77 [2019-03-28 12:09:46,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 40.25/19.77 [2019-03-28 12:09:46,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 40.25/19.77 [2019-03-28 12:09:46,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 40.25/19.77 [2019-03-28 12:09:46,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 40.25/19.77 [2019-03-28 12:09:46,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 40.25/19.77 [2019-03-28 12:09:46,801 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 40.25/19.77 [2019-03-28 12:09:46,815 INFO L110 SettingsManager]: Loading preferences was successful 40.25/19.77 [2019-03-28 12:09:46,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 40.25/19.77 [2019-03-28 12:09:46,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 40.25/19.77 [2019-03-28 12:09:46,817 INFO L133 SettingsManager]: * Rewrite not-equals=true 40.25/19.77 [2019-03-28 12:09:46,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 40.25/19.77 [2019-03-28 12:09:46,817 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 40.25/19.77 [2019-03-28 12:09:46,817 INFO L133 SettingsManager]: * Use SBE=true 40.25/19.77 [2019-03-28 12:09:46,818 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 40.25/19.77 [2019-03-28 12:09:46,818 INFO L133 SettingsManager]: * Use old map elimination=false 40.25/19.77 [2019-03-28 12:09:46,818 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 40.25/19.77 [2019-03-28 12:09:46,818 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 40.25/19.77 [2019-03-28 12:09:46,818 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 40.25/19.77 [2019-03-28 12:09:46,819 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 40.25/19.77 [2019-03-28 12:09:46,819 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 40.25/19.77 [2019-03-28 12:09:46,819 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:46,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 40.25/19.77 [2019-03-28 12:09:46,819 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 40.25/19.77 [2019-03-28 12:09:46,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE 40.25/19.77 [2019-03-28 12:09:46,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 40.25/19.77 [2019-03-28 12:09:46,820 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 40.25/19.77 [2019-03-28 12:09:46,820 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 40.25/19.77 [2019-03-28 12:09:46,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 40.25/19.77 [2019-03-28 12:09:46,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 40.25/19.77 [2019-03-28 12:09:46,820 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 40.25/19.77 [2019-03-28 12:09:46,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 40.25/19.77 [2019-03-28 12:09:46,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 40.25/19.77 [2019-03-28 12:09:46,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 40.25/19.77 [2019-03-28 12:09:46,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 40.25/19.77 [2019-03-28 12:09:46,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 40.25/19.77 [2019-03-28 12:09:46,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 40.25/19.77 [2019-03-28 12:09:46,861 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 40.25/19.77 [2019-03-28 12:09:46,864 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 40.25/19.77 [2019-03-28 12:09:46,866 INFO L271 PluginConnector]: Initializing CDTParser... 40.25/19.77 [2019-03-28 12:09:46,866 INFO L276 PluginConnector]: CDTParser initialized 40.25/19.77 [2019-03-28 12:09:46,867 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/19.77 [2019-03-28 12:09:46,933 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/86141ea8c34f4ad8a00cdd44a02a6a44/FLAGd4ca730e8 40.25/19.77 [2019-03-28 12:09:47,278 INFO L307 CDTParser]: Found 1 translation units. 40.25/19.77 [2019-03-28 12:09:47,278 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/19.77 [2019-03-28 12:09:47,285 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/86141ea8c34f4ad8a00cdd44a02a6a44/FLAGd4ca730e8 40.25/19.77 [2019-03-28 12:09:47,677 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/86141ea8c34f4ad8a00cdd44a02a6a44 40.25/19.77 [2019-03-28 12:09:47,689 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 40.25/19.77 [2019-03-28 12:09:47,691 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 40.25/19.77 [2019-03-28 12:09:47,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 40.25/19.77 [2019-03-28 12:09:47,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 40.25/19.77 [2019-03-28 12:09:47,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 40.25/19.77 [2019-03-28 12:09:47,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:47,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5232ae43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:47,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:47,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 40.25/19.77 [2019-03-28 12:09:47,727 INFO L176 MainTranslator]: Built tables and reachable declarations 40.25/19.77 [2019-03-28 12:09:47,886 INFO L206 PostProcessor]: Analyzing one entry point: main 40.25/19.77 [2019-03-28 12:09:47,891 INFO L191 MainTranslator]: Completed pre-run 40.25/19.77 [2019-03-28 12:09:47,908 INFO L206 PostProcessor]: Analyzing one entry point: main 40.25/19.77 [2019-03-28 12:09:47,980 INFO L195 MainTranslator]: Completed translation 40.25/19.77 [2019-03-28 12:09:47,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47 WrapperNode 40.25/19.77 [2019-03-28 12:09:47,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 40.25/19.77 [2019-03-28 12:09:47,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 40.25/19.77 [2019-03-28 12:09:47,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 40.25/19.77 [2019-03-28 12:09:47,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 40.25/19.77 [2019-03-28 12:09:47,993 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:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:47,998 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:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 40.25/19.77 [2019-03-28 12:09:48,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 40.25/19.77 [2019-03-28 12:09:48,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 40.25/19.77 [2019-03-28 12:09:48,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized 40.25/19.77 [2019-03-28 12:09:48,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 40.25/19.77 [2019-03-28 12:09:48,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 40.25/19.77 [2019-03-28 12:09:48,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... 40.25/19.77 [2019-03-28 12:09:48,035 INFO L276 PluginConnector]: RCFGBuilder initialized 40.25/19.77 [2019-03-28 12:09:48,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (1/1) ... 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 40.25/19.77 [2019-03-28 12:09:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 40.25/19.77 [2019-03-28 12:09:48,100 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 40.25/19.77 [2019-03-28 12:09:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 40.25/19.77 [2019-03-28 12:09:48,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 40.25/19.77 [2019-03-28 12:09:48,226 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 40.25/19.77 [2019-03-28 12:09:48,227 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 40.25/19.77 [2019-03-28 12:09:48,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:48 BoogieIcfgContainer 40.25/19.77 [2019-03-28 12:09:48,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 40.25/19.77 [2019-03-28 12:09:48,249 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 40.25/19.77 [2019-03-28 12:09:48,249 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 40.25/19.77 [2019-03-28 12:09:48,251 INFO L276 PluginConnector]: BlockEncodingV2 initialized 40.25/19.77 [2019-03-28 12:09:48,252 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:48" (1/1) ... 40.25/19.77 [2019-03-28 12:09:48,268 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 17 edges 40.25/19.77 [2019-03-28 12:09:48,270 INFO L258 BlockEncoder]: Using Remove infeasible edges 40.25/19.77 [2019-03-28 12:09:48,270 INFO L263 BlockEncoder]: Using Maximize final states 40.25/19.77 [2019-03-28 12:09:48,271 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 40.25/19.77 [2019-03-28 12:09:48,271 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 40.25/19.77 [2019-03-28 12:09:48,273 INFO L296 BlockEncoder]: Using Remove sink states 40.25/19.77 [2019-03-28 12:09:48,274 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 40.25/19.77 [2019-03-28 12:09:48,274 INFO L179 BlockEncoder]: Using Rewrite not-equals 40.25/19.77 [2019-03-28 12:09:48,288 INFO L185 BlockEncoder]: Using Use SBE 40.25/19.77 [2019-03-28 12:09:48,296 INFO L200 BlockEncoder]: SBE split 0 edges 40.25/19.77 [2019-03-28 12:09:48,302 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 40.25/19.77 [2019-03-28 12:09:48,304 INFO L71 MaximizeFinalStates]: 0 new accepting states 40.25/19.77 [2019-03-28 12:09:48,314 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 40.25/19.77 [2019-03-28 12:09:48,316 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 40.25/19.77 [2019-03-28 12:09:48,318 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 40.25/19.77 [2019-03-28 12:09:48,318 INFO L71 MaximizeFinalStates]: 0 new accepting states 40.25/19.77 [2019-03-28 12:09:48,318 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 40.25/19.77 [2019-03-28 12:09:48,319 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 40.25/19.77 [2019-03-28 12:09:48,319 INFO L313 BlockEncoder]: Encoded RCFG 10 locations, 13 edges 40.25/19.77 [2019-03-28 12:09:48,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:48 BasicIcfg 40.25/19.77 [2019-03-28 12:09:48,320 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 40.25/19.77 [2019-03-28 12:09:48,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 40.25/19.77 [2019-03-28 12:09:48,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... 40.25/19.77 [2019-03-28 12:09:48,324 INFO L276 PluginConnector]: TraceAbstraction initialized 40.25/19.77 [2019-03-28 12:09:48,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:09:47" (1/4) ... 40.25/19.77 [2019-03-28 12:09:48,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200d5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (2/4) ... 40.25/19.77 [2019-03-28 12:09:48,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200d5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:48" (3/4) ... 40.25/19.77 [2019-03-28 12:09:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200d5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:48" (4/4) ... 40.25/19.77 [2019-03-28 12:09:48,329 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 40.25/19.77 [2019-03-28 12:09:48,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 40.25/19.77 [2019-03-28 12:09:48,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 40.25/19.77 [2019-03-28 12:09:48,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 40.25/19.77 [2019-03-28 12:09:48,394 INFO L133 ementStrategyFactory]: Using default assertion order modulation 40.25/19.77 [2019-03-28 12:09:48,395 INFO L382 AbstractCegarLoop]: Interprodecural is true 40.25/19.77 [2019-03-28 12:09:48,395 INFO L383 AbstractCegarLoop]: Hoare is true 40.25/19.77 [2019-03-28 12:09:48,396 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 40.25/19.77 [2019-03-28 12:09:48,396 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 40.25/19.77 [2019-03-28 12:09:48,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 40.25/19.77 [2019-03-28 12:09:48,396 INFO L387 AbstractCegarLoop]: Difference is false 40.25/19.77 [2019-03-28 12:09:48,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 40.25/19.77 [2019-03-28 12:09:48,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 40.25/19.77 [2019-03-28 12:09:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. 40.25/19.77 [2019-03-28 12:09:48,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 40.25/19.77 [2019-03-28 12:09:48,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. 40.25/19.77 [2019-03-28 12:09:48,489 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 5 9) the Hoare annotation is: true 40.25/19.77 [2019-03-28 12:09:48,490 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 5 9) no Hoare annotation was computed. 40.25/19.77 [2019-03-28 12:09:48,490 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 5 9) no Hoare annotation was computed. 40.25/19.77 [2019-03-28 12:09:48,491 INFO L451 ceAbstractionStarter]: At program point L8(line 8) the Hoare annotation is: true 40.25/19.77 [2019-03-28 12:09:48,491 INFO L451 ceAbstractionStarter]: At program point L8-1(line 8) the Hoare annotation is: true 40.25/19.77 [2019-03-28 12:09:48,491 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 7) no Hoare annotation was computed. 40.25/19.77 [2019-03-28 12:09:48,491 INFO L451 ceAbstractionStarter]: At program point L8-2(line 8) the Hoare annotation is: true 40.25/19.77 [2019-03-28 12:09:48,491 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. 40.25/19.77 [2019-03-28 12:09:48,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 40.25/19.77 [2019-03-28 12:09:48,492 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true 40.25/19.77 [2019-03-28 12:09:48,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:48 BasicIcfg 40.25/19.77 [2019-03-28 12:09:48,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 40.25/19.77 [2019-03-28 12:09:48,496 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 40.25/19.77 [2019-03-28 12:09:48,496 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 40.25/19.77 [2019-03-28 12:09:48,500 INFO L276 PluginConnector]: BuchiAutomizer initialized 40.25/19.77 [2019-03-28 12:09:48,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.25/19.77 [2019-03-28 12:09:48,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:09:47" (1/5) ... 40.25/19.77 [2019-03-28 12:09:48,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7338a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,502 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.25/19.77 [2019-03-28 12:09:48,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:47" (2/5) ... 40.25/19.77 [2019-03-28 12:09:48,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7338a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.25/19.77 [2019-03-28 12:09:48,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:48" (3/5) ... 40.25/19.77 [2019-03-28 12:09:48,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7338a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.25/19.77 [2019-03-28 12:09:48,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:48" (4/5) ... 40.25/19.77 [2019-03-28 12:09:48,504 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7338a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:09:48, skipping insertion in model container 40.25/19.77 [2019-03-28 12:09:48,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 40.25/19.77 [2019-03-28 12:09:48,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:48" (5/5) ... 40.25/19.77 [2019-03-28 12:09:48,506 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 40.25/19.77 [2019-03-28 12:09:48,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation 40.25/19.77 [2019-03-28 12:09:48,534 INFO L374 BuchiCegarLoop]: Interprodecural is true 40.25/19.77 [2019-03-28 12:09:48,534 INFO L375 BuchiCegarLoop]: Hoare is true 40.25/19.77 [2019-03-28 12:09:48,534 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 40.25/19.77 [2019-03-28 12:09:48,534 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 40.25/19.77 [2019-03-28 12:09:48,535 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 40.25/19.77 [2019-03-28 12:09:48,535 INFO L379 BuchiCegarLoop]: Difference is false 40.25/19.77 [2019-03-28 12:09:48,535 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 40.25/19.77 [2019-03-28 12:09:48,535 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 40.25/19.77 [2019-03-28 12:09:48,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. 40.25/19.77 [2019-03-28 12:09:48,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/19.77 [2019-03-28 12:09:48,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/19.77 [2019-03-28 12:09:48,561 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/19.77 [2019-03-28 12:09:48,568 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 40.25/19.77 [2019-03-28 12:09:48,568 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 40.25/19.77 [2019-03-28 12:09:48,568 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 40.25/19.77 [2019-03-28 12:09:48,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. 40.25/19.77 [2019-03-28 12:09:48,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/19.77 [2019-03-28 12:09:48,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/19.77 [2019-03-28 12:09:48,570 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/19.77 [2019-03-28 12:09:48,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 40.25/19.77 [2019-03-28 12:09:48,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 40.25/19.77 [2019-03-28 12:09:48,576 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 10#L19true [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 6#rec1ENTRYtrue 40.25/19.77 [2019-03-28 12:09:48,577 INFO L796 eck$LassoCheckResult]: Loop: 6#rec1ENTRYtrue [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 11#L6true [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 9#L8true [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 6#rec1ENTRYtrue 40.25/19.77 [2019-03-28 12:09:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1920, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:48,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:48,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash 55151, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:48,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:48,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:48,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 57224080, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:48,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:48,748 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:48,749 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:48,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:48,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:48,749 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/19.77 [2019-03-28 12:09:48,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:48,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:48,750 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:48,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 40.25/19.77 [2019-03-28 12:09:48,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:48,751 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:48,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,877 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:48,878 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:48,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:48,884 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:48,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:48,920 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:48,954 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/19.77 [2019-03-28 12:09:48,957 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:48,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:48,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:48,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:48,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/19.77 [2019-03-28 12:09:48,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:48,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:48,958 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:48,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 40.25/19.77 [2019-03-28 12:09:48,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:48,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:48,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:48,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:49,037 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:49,044 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/19.77 [2019-03-28 12:09:49,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:49,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:49,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:49,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:49,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:49,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:49,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:49,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:49,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/19.77 [2019-03-28 12:09:49,067 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 40.25/19.77 [2019-03-28 12:09:49,067 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 40.25/19.77 [2019-03-28 12:09:49,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/19.77 [2019-03-28 12:09:49,069 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/19.77 [2019-03-28 12:09:49,070 INFO L518 LassoAnalysis]: Proved termination. 40.25/19.77 [2019-03-28 12:09:49,070 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/19.77 Ranking function f(rec1_#in~i) = 1*rec1_#in~i 40.25/19.77 Supporting invariants [] 40.25/19.77 [2019-03-28 12:09:49,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/19.77 [2019-03-28 12:09:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:49,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:49,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:49,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:49,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:49,195 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 40.25/19.77 [2019-03-28 12:09:49,200 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 40.25/19.77 [2019-03-28 12:09:49,202 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states. Second operand 4 states. 40.25/19.77 [2019-03-28 12:09:49,293 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 16 states. 40.25/19.77 [2019-03-28 12:09:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 40.25/19.77 [2019-03-28 12:09:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 40.25/19.77 [2019-03-28 12:09:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. 40.25/19.77 [2019-03-28 12:09:49,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:09:49,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:49,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:09:49,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:49,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 6 letters. 40.25/19.77 [2019-03-28 12:09:49,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:49,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. 40.25/19.77 [2019-03-28 12:09:49,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/19.77 [2019-03-28 12:09:49,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 30 transitions. 40.25/19.77 [2019-03-28 12:09:49,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 40.25/19.77 [2019-03-28 12:09:49,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 40.25/19.77 [2019-03-28 12:09:49,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. 40.25/19.77 [2019-03-28 12:09:49,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:09:49,324 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 40.25/19.77 [2019-03-28 12:09:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. 40.25/19.77 [2019-03-28 12:09:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. 40.25/19.77 [2019-03-28 12:09:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 40.25/19.77 [2019-03-28 12:09:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. 40.25/19.77 [2019-03-28 12:09:49,360 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 40.25/19.77 [2019-03-28 12:09:49,360 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 40.25/19.77 [2019-03-28 12:09:49,360 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 40.25/19.77 [2019-03-28 12:09:49,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. 40.25/19.77 [2019-03-28 12:09:49,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 40.25/19.77 [2019-03-28 12:09:49,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/19.77 [2019-03-28 12:09:49,362 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/19.77 [2019-03-28 12:09:49,363 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 40.25/19.77 [2019-03-28 12:09:49,363 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 40.25/19.77 [2019-03-28 12:09:49,364 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 104#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 107#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 108#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 99#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 109#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 110#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 111#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 98#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 100#L8-1 40.25/19.77 [2019-03-28 12:09:49,364 INFO L796 eck$LassoCheckResult]: Loop: 100#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 112#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 114#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 102#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 112#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 114#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 105#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 113#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 100#L8-1 40.25/19.77 [2019-03-28 12:09:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1932213304, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:49,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash 74335785, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:49,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:49,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -553495824, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:49,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:49,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 40.25/19.77 [2019-03-28 12:09:49,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 40.25/19.77 [2019-03-28 12:09:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:49,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:49,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:49,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 40.25/19.77 [2019-03-28 12:09:49,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 40.25/19.77 [2019-03-28 12:09:49,634 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:49,635 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:49,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:49,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:49,635 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/19.77 [2019-03-28 12:09:49,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:49,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:49,636 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:49,636 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 40.25/19.77 [2019-03-28 12:09:49,636 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:49,636 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:49,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:49,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:49,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:49,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:49,729 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:49,729 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:49,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:49,734 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:49,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:49,740 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:49,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:49,769 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:49,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:49,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:49,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:49,803 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:49,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:49,842 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:51,782 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/19.77 [2019-03-28 12:09:51,785 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:51,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:51,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:51,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:51,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/19.77 [2019-03-28 12:09:51,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:51,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:51,786 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:51,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 40.25/19.77 [2019-03-28 12:09:51,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:51,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:51,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:51,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:51,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:51,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:51,842 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:51,842 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/19.77 [2019-03-28 12:09:51,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:51,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:51,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:51,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:51,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:51,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:51,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:51,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:51,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:51,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:51,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:51,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:51,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:51,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:51,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:51,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:51,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:51,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:51,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:51,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:51,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:51,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:51,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:51,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:51,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:51,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:51,863 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/19.77 [2019-03-28 12:09:51,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.25/19.77 [2019-03-28 12:09:51,870 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 40.25/19.77 [2019-03-28 12:09:51,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/19.77 [2019-03-28 12:09:51,871 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/19.77 [2019-03-28 12:09:51,871 INFO L518 LassoAnalysis]: Proved termination. 40.25/19.77 [2019-03-28 12:09:51,871 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/19.77 Ranking function f(rec1_#t~ret0) = 1*rec1_#t~ret0 40.25/19.77 Supporting invariants [] 40.25/19.77 [2019-03-28 12:09:51,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/19.77 [2019-03-28 12:09:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:51,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:51,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:51,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:51,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:52,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:52,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:52,143 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 10 predicates after loop cannibalization 40.25/19.77 [2019-03-28 12:09:52,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 10 loop predicates 40.25/19.77 [2019-03-28 12:09:52,144 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 8 states. 40.25/19.77 [2019-03-28 12:09:55,002 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 22 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 13989 states and 28369 transitions. Complement of second has 7508 states. 40.25/19.77 [2019-03-28 12:09:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 18 non-accepting loop states 2 accepting loop states 40.25/19.77 [2019-03-28 12:09:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 40.25/19.77 [2019-03-28 12:09:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. 40.25/19.77 [2019-03-28 12:09:55,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 9 letters. Loop has 8 letters. 40.25/19.77 [2019-03-28 12:09:55,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:55,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 17 letters. Loop has 8 letters. 40.25/19.77 [2019-03-28 12:09:55,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:55,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 104 transitions. Stem has 9 letters. Loop has 16 letters. 40.25/19.77 [2019-03-28 12:09:55,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:55,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13989 states and 28369 transitions. 40.25/19.77 [2019-03-28 12:09:55,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 40.25/19.77 [2019-03-28 12:09:55,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13989 states to 277 states and 449 transitions. 40.25/19.77 [2019-03-28 12:09:55,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 40.25/19.77 [2019-03-28 12:09:55,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 40.25/19.77 [2019-03-28 12:09:55,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 449 transitions. 40.25/19.77 [2019-03-28 12:09:55,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:09:55,465 INFO L706 BuchiCegarLoop]: Abstraction has 277 states and 449 transitions. 40.25/19.77 [2019-03-28 12:09:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 449 transitions. 40.25/19.77 [2019-03-28 12:09:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. 40.25/19.77 [2019-03-28 12:09:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. 40.25/19.77 [2019-03-28 12:09:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 263 transitions. 40.25/19.77 [2019-03-28 12:09:55,498 INFO L729 BuchiCegarLoop]: Abstraction has 171 states and 263 transitions. 40.25/19.77 [2019-03-28 12:09:55,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 40.25/19.77 [2019-03-28 12:09:55,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 40.25/19.77 [2019-03-28 12:09:55,504 INFO L87 Difference]: Start difference. First operand 171 states and 263 transitions. Second operand 6 states. 40.25/19.77 [2019-03-28 12:09:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/19.77 [2019-03-28 12:09:55,563 INFO L93 Difference]: Finished difference Result 161 states and 255 transitions. 40.25/19.77 [2019-03-28 12:09:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 40.25/19.77 [2019-03-28 12:09:55,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 255 transitions. 40.25/19.77 [2019-03-28 12:09:55,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 40.25/19.77 [2019-03-28 12:09:55,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 159 states and 252 transitions. 40.25/19.77 [2019-03-28 12:09:55,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 40.25/19.77 [2019-03-28 12:09:55,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 40.25/19.77 [2019-03-28 12:09:55,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 252 transitions. 40.25/19.77 [2019-03-28 12:09:55,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:09:55,576 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 252 transitions. 40.25/19.77 [2019-03-28 12:09:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 252 transitions. 40.25/19.77 [2019-03-28 12:09:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 123. 40.25/19.77 [2019-03-28 12:09:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. 40.25/19.77 [2019-03-28 12:09:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. 40.25/19.77 [2019-03-28 12:09:55,590 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 184 transitions. 40.25/19.77 [2019-03-28 12:09:55,590 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 184 transitions. 40.25/19.77 [2019-03-28 12:09:55,590 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 40.25/19.77 [2019-03-28 12:09:55,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 184 transitions. 40.25/19.77 [2019-03-28 12:09:55,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 40.25/19.77 [2019-03-28 12:09:55,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/19.77 [2019-03-28 12:09:55,592 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/19.77 [2019-03-28 12:09:55,593 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 40.25/19.77 [2019-03-28 12:09:55,593 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 40.25/19.77 [2019-03-28 12:09:55,593 INFO L794 eck$LassoCheckResult]: Stem: 22144#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 22145#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 22167#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22169#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22178#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22241#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22252#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 22255#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22254#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 22148#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 22146#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22149#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 22166#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22258#rec1EXIT >[40] rec1EXIT-->L8-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 22140#L8-2 [36] L8-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 22165#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22170#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22171#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22180#rec1ENTRY 40.25/19.77 [2019-03-28 12:09:55,594 INFO L796 eck$LassoCheckResult]: Loop: 22180#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 22221#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 22174#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 22180#rec1ENTRY 40.25/19.77 [2019-03-28 12:09:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1324911227, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:55,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:55,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 40.25/19.77 [2019-03-28 12:09:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 40.25/19.77 [2019-03-28 12:09:55,642 INFO L799 eck$LassoCheckResult]: stem already infeasible 40.25/19.77 [2019-03-28 12:09:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 55151, now seen corresponding path program 2 times 40.25/19.77 [2019-03-28 12:09:55,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:55,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:55,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:55,679 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:55,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:55,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:55,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:55,680 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/19.77 [2019-03-28 12:09:55,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:55,680 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:55,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 40.25/19.77 [2019-03-28 12:09:55,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:55,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:55,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:55,743 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:55,744 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,750 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:55,754 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:55,754 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,786 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:55,789 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:55,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,822 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:55,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:55,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,880 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:55,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:55,901 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,930 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:55,934 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:55,934 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,963 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:55,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:55,994 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:56,027 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/19.77 [2019-03-28 12:09:56,029 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:56,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:56,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:56,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:56,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/19.77 [2019-03-28 12:09:56,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:56,030 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:56,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 40.25/19.77 [2019-03-28 12:09:56,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:56,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:56,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,089 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:56,089 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/19.77 [2019-03-28 12:09:56,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:56,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:56,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:56,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:56,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:09:56,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:09:56,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:09:56,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:09:56,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:09:56,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:09:56,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:09:56,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:09:56,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:09:56,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/19.77 [2019-03-28 12:09:56,113 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 40.25/19.77 [2019-03-28 12:09:56,113 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 40.25/19.77 [2019-03-28 12:09:56,114 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/19.77 [2019-03-28 12:09:56,114 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/19.77 [2019-03-28 12:09:56,114 INFO L518 LassoAnalysis]: Proved termination. 40.25/19.77 [2019-03-28 12:09:56,114 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/19.77 Ranking function f(rec1_#in~i) = 1*rec1_#in~i 40.25/19.77 Supporting invariants [] 40.25/19.77 [2019-03-28 12:09:56,115 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/19.77 [2019-03-28 12:09:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:56,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:56,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:56,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:56,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:56,272 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 40.25/19.77 [2019-03-28 12:09:56,272 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 40.25/19.77 [2019-03-28 12:09:56,272 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 123 states and 184 transitions. cyclomatic complexity: 64 Second operand 5 states. 40.25/19.77 [2019-03-28 12:09:56,472 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 123 states and 184 transitions. cyclomatic complexity: 64. Second operand 5 states. Result 354 states and 433 transitions. Complement of second has 48 states. 40.25/19.77 [2019-03-28 12:09:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states 40.25/19.77 [2019-03-28 12:09:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 40.25/19.77 [2019-03-28 12:09:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 40.25/19.77 [2019-03-28 12:09:56,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:09:56,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:56,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 21 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:09:56,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:56,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 18 letters. Loop has 6 letters. 40.25/19.77 [2019-03-28 12:09:56,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:09:56,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 433 transitions. 40.25/19.77 [2019-03-28 12:09:56,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 40.25/19.77 [2019-03-28 12:09:56,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 164 states and 241 transitions. 40.25/19.77 [2019-03-28 12:09:56,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 40.25/19.77 [2019-03-28 12:09:56,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 40.25/19.77 [2019-03-28 12:09:56,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 241 transitions. 40.25/19.77 [2019-03-28 12:09:56,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:09:56,489 INFO L706 BuchiCegarLoop]: Abstraction has 164 states and 241 transitions. 40.25/19.77 [2019-03-28 12:09:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 241 transitions. 40.25/19.77 [2019-03-28 12:09:56,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. 40.25/19.77 [2019-03-28 12:09:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. 40.25/19.77 [2019-03-28 12:09:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. 40.25/19.77 [2019-03-28 12:09:56,499 INFO L729 BuchiCegarLoop]: Abstraction has 134 states and 193 transitions. 40.25/19.77 [2019-03-28 12:09:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 40.25/19.77 [2019-03-28 12:09:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 40.25/19.77 [2019-03-28 12:09:56,499 INFO L87 Difference]: Start difference. First operand 134 states and 193 transitions. Second operand 6 states. 40.25/19.77 [2019-03-28 12:09:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/19.77 [2019-03-28 12:09:56,559 INFO L93 Difference]: Finished difference Result 153 states and 212 transitions. 40.25/19.77 [2019-03-28 12:09:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 40.25/19.77 [2019-03-28 12:09:56,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 212 transitions. 40.25/19.77 [2019-03-28 12:09:56,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 40.25/19.77 [2019-03-28 12:09:56,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 148 states and 203 transitions. 40.25/19.77 [2019-03-28 12:09:56,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 40.25/19.77 [2019-03-28 12:09:56,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 40.25/19.77 [2019-03-28 12:09:56,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 203 transitions. 40.25/19.77 [2019-03-28 12:09:56,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:09:56,567 INFO L706 BuchiCegarLoop]: Abstraction has 148 states and 203 transitions. 40.25/19.77 [2019-03-28 12:09:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 203 transitions. 40.25/19.77 [2019-03-28 12:09:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 137. 40.25/19.77 [2019-03-28 12:09:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. 40.25/19.77 [2019-03-28 12:09:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:09:56,575 INFO L729 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:09:56,575 INFO L609 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:09:56,575 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 40.25/19.77 [2019-03-28 12:09:56,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:09:56,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 40.25/19.77 [2019-03-28 12:09:56,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 40.25/19.77 [2019-03-28 12:09:56,577 INFO L119 BuchiIsEmpty]: Starting construction of run 40.25/19.77 [2019-03-28 12:09:56,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] 40.25/19.77 [2019-03-28 12:09:56,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 40.25/19.77 [2019-03-28 12:09:56,579 INFO L794 eck$LassoCheckResult]: Stem: 23055#ULTIMATE.startENTRY [30] ULTIMATE.startENTRY-->L19: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 23056#L19 [29] L19-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 23070#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23146#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23127#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23143#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23149#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23128#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23129#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23148#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23147#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23144#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 23139#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 23141#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23145#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23142#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23138#rec1EXIT >[40] rec1EXIT-->L8-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 23133#L8-2 [36] L8-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 23135#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23150#L6 [34] L6-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 23136#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23132#rec1EXIT >[39] rec1EXIT-->L8-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 23131#L8-3 [31] L8-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 23130#rec1FINAL [26] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23126#rec1EXIT >[41] rec1EXIT-->L8-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 23086#L8-1 [32] L8-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 23116#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23160#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23120#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23121#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23124#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23119#L8 40.25/19.77 [2019-03-28 12:09:56,579 INFO L796 eck$LassoCheckResult]: Loop: 23119#L8 [33] L8-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 23123#rec1ENTRY [25] rec1ENTRY-->L6: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 23124#L6 [42] L6-->L8: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 23119#L8 40.25/19.77 [2019-03-28 12:09:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 37993876, now seen corresponding path program 1 times 40.25/19.77 [2019-03-28 12:09:56,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:56,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 40.25/19.77 [2019-03-28 12:09:56,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 40.25/19.77 [2019-03-28 12:09:56,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:09:56,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:09:56,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:09:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:09:56,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 40.25/19.77 [2019-03-28 12:09:56,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 40.25/19.77 [2019-03-28 12:09:56,718 INFO L799 eck$LassoCheckResult]: stem already infeasible 40.25/19.77 [2019-03-28 12:09:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:09:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 62321, now seen corresponding path program 3 times 40.25/19.77 [2019-03-28 12:09:56,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 40.25/19.77 [2019-03-28 12:09:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 40.25/19.77 [2019-03-28 12:09:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 40.25/19.77 [2019-03-28 12:09:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 40.25/19.77 [2019-03-28 12:09:56,759 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:09:56,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:09:56,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:09:56,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:09:56,760 INFO L127 ssoRankerPreferences]: Use exernal solver: true 40.25/19.77 [2019-03-28 12:09:56,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:09:56,760 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:09:56,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 40.25/19.77 [2019-03-28 12:09:56,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:09:56,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:09:56,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:09:56,820 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:09:56,821 INFO L412 LassoAnalysis]: Checking for nontermination... 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:56,827 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:56,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:56,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:56,861 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:56,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:56,868 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:56,898 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:56,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:56,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:56,933 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:09:56,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. 40.25/19.77 [2019-03-28 12:09:56,937 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:56,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:56,967 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 40.25/19.77 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 40.25/19.77 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:09:57,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 40.25/19.77 [2019-03-28 12:09:57,002 INFO L163 nArgumentSynthesizer]: Using integer mode. 40.25/19.77 [2019-03-28 12:10:02,422 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 40.25/19.77 [2019-03-28 12:10:02,426 INFO L216 LassoAnalysis]: Preferences: 40.25/19.77 [2019-03-28 12:10:02,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 40.25/19.77 [2019-03-28 12:10:02,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 40.25/19.77 [2019-03-28 12:10:02,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 40.25/19.77 [2019-03-28 12:10:02,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false 40.25/19.77 [2019-03-28 12:10:02,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 40.25/19.77 [2019-03-28 12:10:02,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 40.25/19.77 [2019-03-28 12:10:02,426 INFO L130 ssoRankerPreferences]: Path of dumped script: 40.25/19.77 [2019-03-28 12:10:02,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 40.25/19.77 [2019-03-28 12:10:02,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 40.25/19.77 [2019-03-28 12:10:02,427 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 40.25/19.77 [2019-03-28 12:10:02,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:10:02,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:10:02,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:10:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:10:02,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 40.25/19.77 [2019-03-28 12:10:02,471 INFO L300 LassoAnalysis]: Preprocessing complete. 40.25/19.77 [2019-03-28 12:10:02,471 INFO L497 LassoAnalysis]: Using template 'affine'. 40.25/19.77 [2019-03-28 12:10:02,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:10:02,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:10:02,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:10:02,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:10:02,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:10:02,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:10:02,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:10:02,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:10:02,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:10:02,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:10:02,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:10:02,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:10:02,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:10:02,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:10:02,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:10:02,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:10:02,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:10:02,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:10:02,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:10:02,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:10:02,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:10:02,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:10:02,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:10:02,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:10:02,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:10:02,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:10:02,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:10:02,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:10:02,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:10:02,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:10:02,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:10:02,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:10:02,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:10:02,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:10:02,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:10:02,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 40.25/19.77 [2019-03-28 12:10:02,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 40.25/19.77 Termination analysis: LINEAR_WITH_GUESSES 40.25/19.77 Number of strict supporting invariants: 0 40.25/19.77 Number of non-strict supporting invariants: 1 40.25/19.77 Consider only non-deceasing supporting invariants: true 40.25/19.77 Simplify termination arguments: true 40.25/19.77 Simplify supporting invariants: trueOverapproximate stem: false 40.25/19.77 [2019-03-28 12:10:02,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. 40.25/19.77 [2019-03-28 12:10:02,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 40.25/19.77 [2019-03-28 12:10:02,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 40.25/19.77 [2019-03-28 12:10:02,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 40.25/19.77 [2019-03-28 12:10:02,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 40.25/19.77 [2019-03-28 12:10:02,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 40.25/19.77 [2019-03-28 12:10:02,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 40.25/19.77 [2019-03-28 12:10:02,489 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 40.25/19.77 [2019-03-28 12:10:02,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 40.25/19.77 [2019-03-28 12:10:02,498 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 40.25/19.77 [2019-03-28 12:10:02,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 40.25/19.77 [2019-03-28 12:10:02,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 40.25/19.77 [2019-03-28 12:10:02,499 INFO L518 LassoAnalysis]: Proved termination. 40.25/19.77 [2019-03-28 12:10:02,499 INFO L520 LassoAnalysis]: Termination argument consisting of: 40.25/19.77 Ranking function f(rec1_~i) = 1*rec1_~i 40.25/19.77 Supporting invariants [] 40.25/19.77 [2019-03-28 12:10:02,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 40.25/19.77 [2019-03-28 12:10:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 40.25/19.77 [2019-03-28 12:10:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:10:02,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:10:02,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:10:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:10:02,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:10:02,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:10:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 40.25/19.77 [2019-03-28 12:10:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 40.25/19.77 [2019-03-28 12:10:02,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 40.25/19.77 [2019-03-28 12:10:02,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... 40.25/19.77 [2019-03-28 12:10:02,744 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 40.25/19.77 [2019-03-28 12:10:02,744 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates 40.25/19.77 [2019-03-28 12:10:02,744 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 137 states and 187 transitions. cyclomatic complexity: 52 Second operand 5 states. 40.25/19.77 [2019-03-28 12:10:02,850 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 137 states and 187 transitions. cyclomatic complexity: 52. Second operand 5 states. Result 352 states and 467 transitions. Complement of second has 76 states. 40.25/19.77 [2019-03-28 12:10:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states 40.25/19.77 [2019-03-28 12:10:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 40.25/19.77 [2019-03-28 12:10:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. 40.25/19.77 [2019-03-28 12:10:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 31 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:10:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:10:02,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 34 letters. Loop has 3 letters. 40.25/19.77 [2019-03-28 12:10:02,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:10:02,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 31 letters. Loop has 6 letters. 40.25/19.77 [2019-03-28 12:10:02,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. 40.25/19.77 [2019-03-28 12:10:02,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 467 transitions. 40.25/19.77 [2019-03-28 12:10:02,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 40.25/19.77 [2019-03-28 12:10:02,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 167 states and 235 transitions. 40.25/19.77 [2019-03-28 12:10:02,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 40.25/19.77 [2019-03-28 12:10:02,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 40.25/19.77 [2019-03-28 12:10:02,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 235 transitions. 40.25/19.77 [2019-03-28 12:10:02,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 40.25/19.77 [2019-03-28 12:10:02,864 INFO L706 BuchiCegarLoop]: Abstraction has 167 states and 235 transitions. 40.25/19.77 [2019-03-28 12:10:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 235 transitions. 40.25/19.77 [2019-03-28 12:10:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. 40.25/19.77 [2019-03-28 12:10:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. 40.25/19.77 [2019-03-28 12:10:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:10:02,873 INFO L729 BuchiCegarLoop]: Abstraction has 137 states and 187 transitions. 40.25/19.77 [2019-03-28 12:10:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 40.25/19.77 [2019-03-28 12:10:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 40.25/19.77 [2019-03-28 12:10:02,874 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand 8 states. 40.25/19.77 [2019-03-28 12:10:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 40.25/19.77 [2019-03-28 12:10:02,942 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. 40.25/19.77 [2019-03-28 12:10:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 40.25/19.77 [2019-03-28 12:10:02,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. 40.25/19.77 [2019-03-28 12:10:02,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 40.25/19.77 [2019-03-28 12:10:02,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 40.25/19.77 [2019-03-28 12:10:02,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 40.25/19.77 [2019-03-28 12:10:02,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,945 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 40.25/19.77 [2019-03-28 12:10:02,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 40.25/19.77 [2019-03-28 12:10:02,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 40.25/19.77 [2019-03-28 12:10:02,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 40.25/19.77 [2019-03-28 12:10:02,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:10:02 BasicIcfg 40.25/19.77 [2019-03-28 12:10:02,952 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 40.25/19.77 [2019-03-28 12:10:02,953 INFO L168 Benchmark]: Toolchain (without parser) took 15263.49 ms. Allocated memory was 514.9 MB in the beginning and 924.8 MB in the end (delta: 410.0 MB). Free memory was 437.7 MB in the beginning and 541.1 MB in the end (delta: -103.3 MB). Peak memory consumption was 306.7 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,955 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.2 MB. There was no memory consumed. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.44 ms. Allocated memory was 514.9 MB in the beginning and 549.5 MB in the end (delta: 34.6 MB). Free memory was 437.7 MB in the beginning and 521.3 MB in the end (delta: -83.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 549.5 MB. Free memory was 521.3 MB in the beginning and 519.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,956 INFO L168 Benchmark]: Boogie Preprocessor took 16.38 ms. Allocated memory is still 549.5 MB. Free memory was 519.7 MB in the beginning and 518.9 MB in the end (delta: 791.7 kB). Peak memory consumption was 791.7 kB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,957 INFO L168 Benchmark]: RCFGBuilder took 213.82 ms. Allocated memory is still 549.5 MB. Free memory was 518.9 MB in the beginning and 507.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,957 INFO L168 Benchmark]: BlockEncodingV2 took 71.31 ms. Allocated memory is still 549.5 MB. Free memory was 507.5 MB in the beginning and 502.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,958 INFO L168 Benchmark]: TraceAbstraction took 174.61 ms. Allocated memory is still 549.5 MB. Free memory was 502.7 MB in the beginning and 491.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,958 INFO L168 Benchmark]: BuchiAutomizer took 14456.52 ms. Allocated memory was 549.5 MB in the beginning and 924.8 MB in the end (delta: 375.4 MB). Free memory was 491.4 MB in the beginning and 541.1 MB in the end (delta: -49.7 MB). Peak memory consumption was 325.7 MB. Max. memory is 50.3 GB. 40.25/19.77 [2019-03-28 12:10:02,962 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 40.25/19.77 --- Results --- 40.25/19.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 40.25/19.77 - StatisticsResult: Initial Icfg 40.25/19.77 14 locations, 17 edges 40.25/19.77 - StatisticsResult: Encoded RCFG 40.25/19.77 10 locations, 13 edges 40.25/19.77 * Results from de.uni_freiburg.informatik.ultimate.core: 40.25/19.77 - StatisticsResult: Toolchain Benchmarks 40.25/19.77 Benchmark results are: 40.25/19.77 * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.2 MB. There was no memory consumed. Max. memory is 50.3 GB. 40.25/19.77 * CACSL2BoogieTranslator took 289.44 ms. Allocated memory was 514.9 MB in the beginning and 549.5 MB in the end (delta: 34.6 MB). Free memory was 437.7 MB in the beginning and 521.3 MB in the end (delta: -83.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 40.25/19.77 * Boogie Procedure Inliner took 35.28 ms. Allocated memory is still 549.5 MB. Free memory was 521.3 MB in the beginning and 519.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 40.25/19.77 * Boogie Preprocessor took 16.38 ms. Allocated memory is still 549.5 MB. Free memory was 519.7 MB in the beginning and 518.9 MB in the end (delta: 791.7 kB). Peak memory consumption was 791.7 kB. Max. memory is 50.3 GB. 40.25/19.77 * RCFGBuilder took 213.82 ms. Allocated memory is still 549.5 MB. Free memory was 518.9 MB in the beginning and 507.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 50.3 GB. 40.25/19.77 * BlockEncodingV2 took 71.31 ms. Allocated memory is still 549.5 MB. Free memory was 507.5 MB in the beginning and 502.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 50.3 GB. 40.25/19.77 * TraceAbstraction took 174.61 ms. Allocated memory is still 549.5 MB. Free memory was 502.7 MB in the beginning and 491.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 50.3 GB. 40.25/19.77 * BuchiAutomizer took 14456.52 ms. Allocated memory was 549.5 MB in the beginning and 924.8 MB in the end (delta: 375.4 MB). Free memory was 491.4 MB in the beginning and 541.1 MB in the end (delta: -49.7 MB). Peak memory consumption was 325.7 MB. Max. memory is 50.3 GB. 40.25/19.77 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 40.25/19.77 - AllSpecificationsHoldResult: All specifications hold 40.25/19.77 We were not able to verify any specifiation because the program does not contain any specification. 40.25/19.77 - StatisticsResult: Ultimate Automizer benchmark data 40.25/19.77 CFG has 2 procedures, 10 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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, 5 LocationsWithAnnotation, 17 PreInvPairs, 17 NumberOfFragments, 5 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 40.25/19.77 - StatisticsResult: Constructed decomposition of program 40.25/19.77 Your program was decomposed into 7 terminating modules (3 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a490793 and consists of 23 locations. One nondeterministic module has affine ranking function \old(i) and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. 40.25/19.77 - StatisticsResult: Timing statistics 40.25/19.77 BüchiAutomizer plugin needed 14.4s and 5 iterations. TraceHistogramMax:7. Analysis of lassos took 9.4s. Construction of modules took 0.3s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 137 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 102 SDtfs, 130 SDslu, 263 SDs, 0 SdLazy, 373 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq167 hnf92 smp100 dnf100 smp100 tf110 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.7s 40.25/19.77 - TerminationAnalysisResult: Termination proven 40.25/19.77 Buchi Automizer proved that your program is terminating 40.25/19.77 RESULT: Ultimate proved your program to be correct! 40.25/19.77 !SESSION 2019-03-28 12:09:44.376 ----------------------------------------------- 40.25/19.77 eclipse.buildId=unknown 40.25/19.77 java.version=1.8.0_181 40.25/19.77 java.vendor=Oracle Corporation 40.25/19.77 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 40.25/19.77 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/19.77 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 40.25/19.77 40.25/19.77 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:10:03.197 40.25/19.77 !MESSAGE The workspace will exit with unsaved changes in this session. 40.25/19.77 Received shutdown request... 40.25/19.77 Ultimate: 40.25/19.77 GTK+ Version Check 40.25/19.77 EOF