28.61/19.79 YES 28.61/19.79 28.61/19.80 Ultimate: Cannot open display: 28.61/19.80 This is Ultimate 0.1.24-8dc7c08-m 28.61/19.80 [2019-03-28 12:28:30,528 INFO L170 SettingsManager]: Resetting all preferences to default values... 28.61/19.80 [2019-03-28 12:28:30,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 28.61/19.80 [2019-03-28 12:28:30,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 28.61/19.80 [2019-03-28 12:28:30,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 28.61/19.80 [2019-03-28 12:28:30,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 28.61/19.80 [2019-03-28 12:28:30,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 28.61/19.80 [2019-03-28 12:28:30,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 28.61/19.80 [2019-03-28 12:28:30,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 28.61/19.80 [2019-03-28 12:28:30,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 28.61/19.80 [2019-03-28 12:28:30,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 28.61/19.80 [2019-03-28 12:28:30,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 28.61/19.80 [2019-03-28 12:28:30,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 28.61/19.80 [2019-03-28 12:28:30,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 28.61/19.80 [2019-03-28 12:28:30,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 28.61/19.80 [2019-03-28 12:28:30,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 28.61/19.80 [2019-03-28 12:28:30,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 28.61/19.80 [2019-03-28 12:28:30,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 28.61/19.80 [2019-03-28 12:28:30,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 28.61/19.80 [2019-03-28 12:28:30,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 28.61/19.80 [2019-03-28 12:28:30,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 28.61/19.80 [2019-03-28 12:28:30,564 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 28.61/19.80 [2019-03-28 12:28:30,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 28.61/19.80 [2019-03-28 12:28:30,566 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 28.61/19.80 [2019-03-28 12:28:30,567 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 28.61/19.80 [2019-03-28 12:28:30,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 28.61/19.80 [2019-03-28 12:28:30,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 28.61/19.80 [2019-03-28 12:28:30,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 28.61/19.80 [2019-03-28 12:28:30,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 28.61/19.80 [2019-03-28 12:28:30,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 28.61/19.80 [2019-03-28 12:28:30,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 28.61/19.80 [2019-03-28 12:28:30,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 28.61/19.80 [2019-03-28 12:28:30,572 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 28.61/19.80 [2019-03-28 12:28:30,587 INFO L110 SettingsManager]: Loading preferences was successful 28.61/19.80 [2019-03-28 12:28:30,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 28.61/19.80 [2019-03-28 12:28:30,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 28.61/19.80 [2019-03-28 12:28:30,588 INFO L133 SettingsManager]: * Rewrite not-equals=true 28.61/19.80 [2019-03-28 12:28:30,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 28.61/19.80 [2019-03-28 12:28:30,588 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 28.61/19.80 [2019-03-28 12:28:30,589 INFO L133 SettingsManager]: * Use SBE=true 28.61/19.80 [2019-03-28 12:28:30,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 28.61/19.80 [2019-03-28 12:28:30,589 INFO L133 SettingsManager]: * Use old map elimination=false 28.61/19.80 [2019-03-28 12:28:30,589 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 28.61/19.80 [2019-03-28 12:28:30,589 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 28.61/19.80 [2019-03-28 12:28:30,590 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 28.61/19.80 [2019-03-28 12:28:30,590 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 28.61/19.80 [2019-03-28 12:28:30,590 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 28.61/19.80 [2019-03-28 12:28:30,590 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:30,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 28.61/19.80 [2019-03-28 12:28:30,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 28.61/19.80 [2019-03-28 12:28:30,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE 28.61/19.80 [2019-03-28 12:28:30,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 28.61/19.80 [2019-03-28 12:28:30,591 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 28.61/19.80 [2019-03-28 12:28:30,591 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 28.61/19.80 [2019-03-28 12:28:30,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 28.61/19.80 [2019-03-28 12:28:30,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 28.61/19.80 [2019-03-28 12:28:30,592 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 28.61/19.80 [2019-03-28 12:28:30,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.61/19.80 [2019-03-28 12:28:30,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 28.61/19.80 [2019-03-28 12:28:30,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 28.61/19.80 [2019-03-28 12:28:30,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 28.61/19.80 [2019-03-28 12:28:30,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 28.61/19.80 [2019-03-28 12:28:30,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 28.61/19.80 [2019-03-28 12:28:30,633 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 28.61/19.80 [2019-03-28 12:28:30,637 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 28.61/19.80 [2019-03-28 12:28:30,638 INFO L271 PluginConnector]: Initializing CDTParser... 28.61/19.80 [2019-03-28 12:28:30,638 INFO L276 PluginConnector]: CDTParser initialized 28.61/19.80 [2019-03-28 12:28:30,639 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 28.61/19.80 [2019-03-28 12:28:30,710 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/daf130936638404fac0e4fde3b560f0c/FLAGa570fd0b5 28.61/19.80 [2019-03-28 12:28:31,050 INFO L307 CDTParser]: Found 1 translation units. 28.61/19.80 [2019-03-28 12:28:31,051 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 28.61/19.80 [2019-03-28 12:28:31,058 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/daf130936638404fac0e4fde3b560f0c/FLAGa570fd0b5 28.61/19.80 [2019-03-28 12:28:31,476 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/daf130936638404fac0e4fde3b560f0c 28.61/19.80 [2019-03-28 12:28:31,488 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 28.61/19.80 [2019-03-28 12:28:31,490 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 28.61/19.80 [2019-03-28 12:28:31,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 28.61/19.80 [2019-03-28 12:28:31,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 28.61/19.80 [2019-03-28 12:28:31,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 28.61/19.80 [2019-03-28 12:28:31,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c88747c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:31,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 28.61/19.80 [2019-03-28 12:28:31,524 INFO L176 MainTranslator]: Built tables and reachable declarations 28.61/19.80 [2019-03-28 12:28:31,681 INFO L206 PostProcessor]: Analyzing one entry point: main 28.61/19.80 [2019-03-28 12:28:31,685 INFO L191 MainTranslator]: Completed pre-run 28.61/19.80 [2019-03-28 12:28:31,702 INFO L206 PostProcessor]: Analyzing one entry point: main 28.61/19.80 [2019-03-28 12:28:31,772 INFO L195 MainTranslator]: Completed translation 28.61/19.80 [2019-03-28 12:28:31,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31 WrapperNode 28.61/19.80 [2019-03-28 12:28:31,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 28.61/19.80 [2019-03-28 12:28:31,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 28.61/19.80 [2019-03-28 12:28:31,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 28.61/19.80 [2019-03-28 12:28:31,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 28.61/19.80 [2019-03-28 12:28:31,783 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:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,789 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:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 28.61/19.80 [2019-03-28 12:28:31,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 28.61/19.80 [2019-03-28 12:28:31,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 28.61/19.80 [2019-03-28 12:28:31,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized 28.61/19.80 [2019-03-28 12:28:31,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 [2019-03-28 12:28:31,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 28.61/19.80 [2019-03-28 12:28:31,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 28.61/19.80 [2019-03-28 12:28:31,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... 28.61/19.80 [2019-03-28 12:28:31,827 INFO L276 PluginConnector]: RCFGBuilder initialized 28.61/19.80 [2019-03-28 12:28:31,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (1/1) ... 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.61/19.80 [2019-03-28 12:28:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 28.61/19.80 [2019-03-28 12:28:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 28.61/19.80 [2019-03-28 12:28:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure addition 28.61/19.80 [2019-03-28 12:28:31,893 INFO L138 BoogieDeclarations]: Found implementation of procedure addition 28.61/19.80 [2019-03-28 12:28:32,045 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 28.61/19.80 [2019-03-28 12:28:32,046 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 28.61/19.80 [2019-03-28 12:28:32,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:28:32 BoogieIcfgContainer 28.61/19.80 [2019-03-28 12:28:32,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 28.61/19.80 [2019-03-28 12:28:32,048 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 28.61/19.80 [2019-03-28 12:28:32,048 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 28.61/19.80 [2019-03-28 12:28:32,050 INFO L276 PluginConnector]: BlockEncodingV2 initialized 28.61/19.80 [2019-03-28 12:28:32,051 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:28:32" (1/1) ... 28.61/19.80 [2019-03-28 12:28:32,068 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 27 edges 28.61/19.80 [2019-03-28 12:28:32,070 INFO L258 BlockEncoder]: Using Remove infeasible edges 28.61/19.80 [2019-03-28 12:28:32,070 INFO L263 BlockEncoder]: Using Maximize final states 28.61/19.80 [2019-03-28 12:28:32,071 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 28.61/19.80 [2019-03-28 12:28:32,071 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 28.61/19.80 [2019-03-28 12:28:32,073 INFO L296 BlockEncoder]: Using Remove sink states 28.61/19.80 [2019-03-28 12:28:32,074 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 28.61/19.80 [2019-03-28 12:28:32,074 INFO L179 BlockEncoder]: Using Rewrite not-equals 28.61/19.80 [2019-03-28 12:28:32,090 INFO L185 BlockEncoder]: Using Use SBE 28.61/19.80 [2019-03-28 12:28:32,108 INFO L200 BlockEncoder]: SBE split 4 edges 28.61/19.80 [2019-03-28 12:28:32,113 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 28.61/19.80 [2019-03-28 12:28:32,114 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.61/19.80 [2019-03-28 12:28:32,122 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 28.61/19.80 [2019-03-28 12:28:32,125 INFO L70 RemoveSinkStates]: Removed 10 edges and 5 locations by removing sink states 28.61/19.80 [2019-03-28 12:28:32,127 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.61/19.80 [2019-03-28 12:28:32,127 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.61/19.80 [2019-03-28 12:28:32,135 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 28.61/19.80 [2019-03-28 12:28:32,136 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.61/19.80 [2019-03-28 12:28:32,136 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.61/19.80 [2019-03-28 12:28:32,136 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.61/19.80 [2019-03-28 12:28:32,137 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 28.61/19.80 [2019-03-28 12:28:32,137 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.61/19.80 [2019-03-28 12:28:32,137 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 17 edges 28.61/19.80 [2019-03-28 12:28:32,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:28:32 BasicIcfg 28.61/19.80 [2019-03-28 12:28:32,138 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 28.61/19.80 [2019-03-28 12:28:32,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 28.61/19.80 [2019-03-28 12:28:32,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... 28.61/19.80 [2019-03-28 12:28:32,143 INFO L276 PluginConnector]: TraceAbstraction initialized 28.61/19.80 [2019-03-28 12:28:32,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:28:31" (1/4) ... 28.61/19.80 [2019-03-28 12:28:32,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd24773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (2/4) ... 28.61/19.80 [2019-03-28 12:28:32,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd24773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:28:32" (3/4) ... 28.61/19.80 [2019-03-28 12:28:32,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd24773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:28:32" (4/4) ... 28.61/19.80 [2019-03-28 12:28:32,147 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.61/19.80 [2019-03-28 12:28:32,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 28.61/19.80 [2019-03-28 12:28:32,167 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 28.61/19.80 [2019-03-28 12:28:32,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 28.61/19.80 [2019-03-28 12:28:32,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.61/19.80 [2019-03-28 12:28:32,215 INFO L382 AbstractCegarLoop]: Interprodecural is true 28.61/19.80 [2019-03-28 12:28:32,215 INFO L383 AbstractCegarLoop]: Hoare is true 28.61/19.80 [2019-03-28 12:28:32,215 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 28.61/19.80 [2019-03-28 12:28:32,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 28.61/19.80 [2019-03-28 12:28:32,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.61/19.80 [2019-03-28 12:28:32,216 INFO L387 AbstractCegarLoop]: Difference is false 28.61/19.80 [2019-03-28 12:28:32,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 28.61/19.80 [2019-03-28 12:28:32,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 28.61/19.80 [2019-03-28 12:28:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. 28.61/19.80 [2019-03-28 12:28:32,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 28.61/19.80 [2019-03-28 12:28:32,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. 28.61/19.80 [2019-03-28 12:28:32,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,306 INFO L451 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: true 28.61/19.80 [2019-03-28 12:28:32,307 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,307 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,307 INFO L451 ceAbstractionStarter]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true 28.61/19.80 [2019-03-28 12:28:32,307 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,308 INFO L448 ceAbstractionStarter]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,308 INFO L448 ceAbstractionStarter]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,308 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true 28.61/19.80 [2019-03-28 12:28:32,308 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,309 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. 28.61/19.80 [2019-03-28 12:28:32,309 INFO L451 ceAbstractionStarter]: At program point L18(line 18) the Hoare annotation is: true 28.61/19.80 [2019-03-28 12:28:32,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:28:32 BasicIcfg 28.61/19.80 [2019-03-28 12:28:32,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 28.61/19.80 [2019-03-28 12:28:32,313 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 28.61/19.80 [2019-03-28 12:28:32,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 28.61/19.80 [2019-03-28 12:28:32,317 INFO L276 PluginConnector]: BuchiAutomizer initialized 28.61/19.80 [2019-03-28 12:28:32,317 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.61/19.80 [2019-03-28 12:28:32,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:28:31" (1/5) ... 28.61/19.80 [2019-03-28 12:28:32,318 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ceb5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.61/19.80 [2019-03-28 12:28:32,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:28:31" (2/5) ... 28.61/19.80 [2019-03-28 12:28:32,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ceb5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.61/19.80 [2019-03-28 12:28:32,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:28:32" (3/5) ... 28.61/19.80 [2019-03-28 12:28:32,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ceb5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.61/19.80 [2019-03-28 12:28:32,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:28:32" (4/5) ... 28.61/19.80 [2019-03-28 12:28:32,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ceb5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:28:32, skipping insertion in model container 28.61/19.80 [2019-03-28 12:28:32,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.61/19.80 [2019-03-28 12:28:32,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:28:32" (5/5) ... 28.61/19.80 [2019-03-28 12:28:32,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.61/19.80 [2019-03-28 12:28:32,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.61/19.80 [2019-03-28 12:28:32,350 INFO L374 BuchiCegarLoop]: Interprodecural is true 28.61/19.80 [2019-03-28 12:28:32,350 INFO L375 BuchiCegarLoop]: Hoare is true 28.61/19.80 [2019-03-28 12:28:32,350 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 28.61/19.80 [2019-03-28 12:28:32,350 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 28.61/19.80 [2019-03-28 12:28:32,350 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.61/19.80 [2019-03-28 12:28:32,350 INFO L379 BuchiCegarLoop]: Difference is false 28.61/19.80 [2019-03-28 12:28:32,350 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 28.61/19.80 [2019-03-28 12:28:32,351 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 28.61/19.80 [2019-03-28 12:28:32,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 28.61/19.80 [2019-03-28 12:28:32,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.61/19.80 [2019-03-28 12:28:32,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.61/19.80 [2019-03-28 12:28:32,375 INFO L119 BuchiIsEmpty]: Starting construction of run 28.61/19.80 [2019-03-28 12:28:32,382 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 28.61/19.80 [2019-03-28 12:28:32,383 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:32,383 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 28.61/19.80 [2019-03-28 12:28:32,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 28.61/19.80 [2019-03-28 12:28:32,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.61/19.80 [2019-03-28 12:28:32,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.61/19.80 [2019-03-28 12:28:32,385 INFO L119 BuchiIsEmpty]: Starting construction of run 28.61/19.80 [2019-03-28 12:28:32,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 28.61/19.80 [2019-03-28 12:28:32,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:32,391 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 11#L35true [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue 28.61/19.80 [2019-03-28 12:28:32,391 INFO L796 eck$LassoCheckResult]: Loop: 3#additionENTRYtrue [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 8#L14true [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 13#L17true [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 10#L18true [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue 28.61/19.80 [2019-03-28 12:28:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash 3850, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:32,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:32,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2794489, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:32,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:32,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash -737540478, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:32,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:32,590 INFO L216 LassoAnalysis]: Preferences: 28.61/19.80 [2019-03-28 12:28:32,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.61/19.80 [2019-03-28 12:28:32,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.61/19.80 [2019-03-28 12:28:32,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.61/19.80 [2019-03-28 12:28:32,592 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.61/19.80 [2019-03-28 12:28:32,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.61/19.80 [2019-03-28 12:28:32,592 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.61/19.80 [2019-03-28 12:28:32,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 28.61/19.80 [2019-03-28 12:28:32,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.61/19.80 [2019-03-28 12:28:32,593 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.61/19.80 [2019-03-28 12:28:32,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:32,708 INFO L300 LassoAnalysis]: Preprocessing complete. 28.61/19.80 [2019-03-28 12:28:32,709 INFO L412 LassoAnalysis]: Checking for nontermination... 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,717 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:32,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:32,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_~m=0} Honda state: {addition_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,763 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:32,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:32,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,796 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:32,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:32,800 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,830 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,863 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:32,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:32,881 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=0} Honda state: {addition_#in~m=0} Generalized eigenvectors: [{addition_#in~m=5}, {addition_#in~m=4}, {addition_#in~m=-8}] Lambdas: [1, 3, 1] Nus: [0, 1] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,911 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:32,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:32,916 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,944 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:32,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:32,978 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:33,008 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.61/19.80 [2019-03-28 12:28:33,011 INFO L216 LassoAnalysis]: Preferences: 28.61/19.80 [2019-03-28 12:28:33,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.61/19.80 [2019-03-28 12:28:33,011 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.61/19.80 [2019-03-28 12:28:33,011 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.61/19.80 [2019-03-28 12:28:33,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.61/19.80 [2019-03-28 12:28:33,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:33,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.61/19.80 [2019-03-28 12:28:33,012 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.61/19.80 [2019-03-28 12:28:33,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 28.61/19.80 [2019-03-28 12:28:33,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.61/19.80 [2019-03-28 12:28:33,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.61/19.80 [2019-03-28 12:28:33,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,091 INFO L300 LassoAnalysis]: Preprocessing complete. 28.61/19.80 [2019-03-28 12:28:33,097 INFO L497 LassoAnalysis]: Using template 'affine'. 28.61/19.80 [2019-03-28 12:28:33,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:33,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:33,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:33,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:33,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:33,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:33,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:33,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:33,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:33,138 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.61/19.80 [2019-03-28 12:28:33,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.61/19.80 [2019-03-28 12:28:33,143 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.61/19.80 [2019-03-28 12:28:33,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.61/19.80 [2019-03-28 12:28:33,146 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.61/19.80 [2019-03-28 12:28:33,146 INFO L518 LassoAnalysis]: Proved termination. 28.61/19.80 [2019-03-28 12:28:33,146 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.61/19.80 Ranking function f(addition_#in~n) = 1*addition_#in~n 28.61/19.80 Supporting invariants [] 28.61/19.80 [2019-03-28 12:28:33,148 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.61/19.80 [2019-03-28 12:28:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:33,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:33,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:33,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:33,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:33,270 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 28.61/19.80 [2019-03-28 12:28:33,275 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 28.61/19.80 [2019-03-28 12:28:33,277 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. 28.61/19.80 [2019-03-28 12:28:33,434 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 80 states and 114 transitions. Complement of second has 19 states. 28.61/19.80 [2019-03-28 12:28:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states 28.61/19.80 [2019-03-28 12:28:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 28.61/19.80 [2019-03-28 12:28:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. 28.61/19.80 [2019-03-28 12:28:33,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 2 letters. Loop has 4 letters. 28.61/19.80 [2019-03-28 12:28:33,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:33,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 4 letters. 28.61/19.80 [2019-03-28 12:28:33,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:33,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 2 letters. Loop has 8 letters. 28.61/19.80 [2019-03-28 12:28:33,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:33,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 114 transitions. 28.61/19.80 [2019-03-28 12:28:33,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.61/19.80 [2019-03-28 12:28:33,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 26 states and 32 transitions. 28.61/19.80 [2019-03-28 12:28:33,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 28.61/19.80 [2019-03-28 12:28:33,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 28.61/19.80 [2019-03-28 12:28:33,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. 28.61/19.80 [2019-03-28 12:28:33,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.61/19.80 [2019-03-28 12:28:33,470 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. 28.61/19.80 [2019-03-28 12:28:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. 28.61/19.80 [2019-03-28 12:28:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. 28.61/19.80 [2019-03-28 12:28:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 28.61/19.80 [2019-03-28 12:28:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. 28.61/19.80 [2019-03-28 12:28:33,503 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. 28.61/19.80 [2019-03-28 12:28:33,504 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. 28.61/19.80 [2019-03-28 12:28:33,504 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 28.61/19.80 [2019-03-28 12:28:33,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. 28.61/19.80 [2019-03-28 12:28:33,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.61/19.80 [2019-03-28 12:28:33,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.61/19.80 [2019-03-28 12:28:33,505 INFO L119 BuchiIsEmpty]: Starting construction of run 28.61/19.80 [2019-03-28 12:28:33,505 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:33,505 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:33,506 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 157#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 159#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 161#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 165#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 154#L20 28.61/19.80 [2019-03-28 12:28:33,506 INFO L796 eck$LassoCheckResult]: Loop: 154#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 156#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 163#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 168#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 167#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 154#L20 28.61/19.80 [2019-03-28 12:28:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 114755754, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.61/19.80 [2019-03-28 12:28:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 28.61/19.80 [2019-03-28 12:28:33,575 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.61/19.80 [2019-03-28 12:28:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash 75491185, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:33,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:33,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:33,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:33,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.61/19.80 [2019-03-28 12:28:33,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 28.61/19.80 [2019-03-28 12:28:33,593 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.61/19.80 [2019-03-28 12:28:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.61/19.80 [2019-03-28 12:28:33,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.61/19.80 [2019-03-28 12:28:33,597 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. 28.61/19.80 [2019-03-28 12:28:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.61/19.80 [2019-03-28 12:28:33,615 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.61/19.80 [2019-03-28 12:28:33,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 28.61/19.80 [2019-03-28 12:28:33,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 28.61/19.80 [2019-03-28 12:28:33,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 28.61/19.80 [2019-03-28 12:28:33,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.61/19.80 [2019-03-28 12:28:33,623 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. 28.61/19.80 [2019-03-28 12:28:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. 28.61/19.80 [2019-03-28 12:28:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 28.61/19.80 [2019-03-28 12:28:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 28.61/19.80 [2019-03-28 12:28:33,625 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 28.61/19.80 [2019-03-28 12:28:33,625 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 28.61/19.80 [2019-03-28 12:28:33,625 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 28.61/19.80 [2019-03-28 12:28:33,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. 28.61/19.80 [2019-03-28 12:28:33,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 28.61/19.80 [2019-03-28 12:28:33,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.61/19.80 [2019-03-28 12:28:33,626 INFO L119 BuchiIsEmpty]: Starting construction of run 28.61/19.80 [2019-03-28 12:28:33,627 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:33,627 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:33,627 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 204#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 209#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 202#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 210#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 203#L20 28.61/19.80 [2019-03-28 12:28:33,628 INFO L796 eck$LassoCheckResult]: Loop: 203#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 197#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 195#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 198#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 207#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 203#L20 28.61/19.80 [2019-03-28 12:28:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 114755754, now seen corresponding path program 2 times 28.61/19.80 [2019-03-28 12:28:33,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:33,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.61/19.80 [2019-03-28 12:28:33,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 28.61/19.80 [2019-03-28 12:28:33,655 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.61/19.80 [2019-03-28 12:28:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 75491216, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:33,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:33,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:33,767 INFO L216 LassoAnalysis]: Preferences: 28.61/19.80 [2019-03-28 12:28:33,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.61/19.80 [2019-03-28 12:28:33,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.61/19.80 [2019-03-28 12:28:33,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.61/19.80 [2019-03-28 12:28:33,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.61/19.80 [2019-03-28 12:28:33,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:33,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.61/19.80 [2019-03-28 12:28:33,768 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.61/19.80 [2019-03-28 12:28:33,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.61/19.80 [2019-03-28 12:28:33,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.61/19.80 [2019-03-28 12:28:33,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.61/19.80 [2019-03-28 12:28:33,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:33,868 INFO L300 LassoAnalysis]: Preprocessing complete. 28.61/19.80 [2019-03-28 12:28:33,869 INFO L412 LassoAnalysis]: Checking for nontermination... 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:33,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:33,879 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:33,883 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:33,883 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:33,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:33,915 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:33,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:33,956 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:34,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:34,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=-8, addition_~m=-8} Honda state: {addition_#in~m=-8, addition_~m=-8} Generalized eigenvectors: [{addition_#in~m=7, addition_~m=-1}, {addition_#in~m=-8, addition_~m=0}, {addition_#in~m=0, addition_~m=0}] Lambdas: [1, 0, 15] Nus: [1, 0] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:34,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:34,157 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:34,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:34,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:34,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:34,190 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:34,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.61/19.80 [2019-03-28 12:28:34,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:34,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:34,223 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.61/19.80 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.61/19.80 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:34,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.61/19.80 [2019-03-28 12:28:34,260 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.61/19.80 [2019-03-28 12:28:46,299 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 28.61/19.80 [2019-03-28 12:28:46,303 INFO L216 LassoAnalysis]: Preferences: 28.61/19.80 [2019-03-28 12:28:46,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.61/19.80 [2019-03-28 12:28:46,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.61/19.80 [2019-03-28 12:28:46,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.61/19.80 [2019-03-28 12:28:46,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.61/19.80 [2019-03-28 12:28:46,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.61/19.80 [2019-03-28 12:28:46,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.61/19.80 [2019-03-28 12:28:46,304 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.61/19.80 [2019-03-28 12:28:46,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.61/19.80 [2019-03-28 12:28:46,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.61/19.80 [2019-03-28 12:28:46,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.61/19.80 [2019-03-28 12:28:46,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:46,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:46,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:46,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:46,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.61/19.80 [2019-03-28 12:28:46,374 INFO L300 LassoAnalysis]: Preprocessing complete. 28.61/19.80 [2019-03-28 12:28:46,375 INFO L497 LassoAnalysis]: Using template 'affine'. 28.61/19.80 [2019-03-28 12:28:46,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:46,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:46,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:46,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:46,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:46,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:46,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:46,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:46,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:46,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:46,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:46,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:46,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:46,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:46,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:46,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:46,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:46,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:46,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:46,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:46,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:46,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:46,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:46,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:46,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:46,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:46,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:46,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:46,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:46,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:46,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:46,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:46,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:46,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:46,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:46,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.61/19.80 [2019-03-28 12:28:46,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.61/19.80 Termination analysis: LINEAR_WITH_GUESSES 28.61/19.80 Number of strict supporting invariants: 0 28.61/19.80 Number of non-strict supporting invariants: 1 28.61/19.80 Consider only non-deceasing supporting invariants: true 28.61/19.80 Simplify termination arguments: true 28.61/19.80 Simplify supporting invariants: trueOverapproximate stem: false 28.61/19.80 [2019-03-28 12:28:46,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.61/19.80 [2019-03-28 12:28:46,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.61/19.80 [2019-03-28 12:28:46,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.61/19.80 [2019-03-28 12:28:46,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.61/19.80 [2019-03-28 12:28:46,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.61/19.80 [2019-03-28 12:28:46,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.61/19.80 [2019-03-28 12:28:46,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.61/19.80 [2019-03-28 12:28:46,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.61/19.80 [2019-03-28 12:28:46,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.61/19.80 [2019-03-28 12:28:46,405 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 28.61/19.80 [2019-03-28 12:28:46,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.61/19.80 [2019-03-28 12:28:46,406 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.61/19.80 [2019-03-28 12:28:46,406 INFO L518 LassoAnalysis]: Proved termination. 28.61/19.80 [2019-03-28 12:28:46,406 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.61/19.80 Ranking function f(addition_~n) = -1*addition_~n 28.61/19.80 Supporting invariants [] 28.61/19.80 [2019-03-28 12:28:46,407 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.61/19.80 [2019-03-28 12:28:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:46,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.61/19.80 [2019-03-28 12:28:46,493 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.61/19.80 [2019-03-28 12:28:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:46,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.61/19.80 [2019-03-28 12:28:46,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.61/19.80 [2019-03-28 12:28:46,604 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 28.61/19.80 [2019-03-28 12:28:46,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 28.61/19.80 [2019-03-28 12:28:46,604 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. 28.61/19.80 [2019-03-28 12:28:46,679 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 112 states and 141 transitions. Complement of second has 83 states. 28.61/19.80 [2019-03-28 12:28:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states 28.61/19.80 [2019-03-28 12:28:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 28.61/19.80 [2019-03-28 12:28:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. 28.61/19.80 [2019-03-28 12:28:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 5 letters. Loop has 5 letters. 28.61/19.80 [2019-03-28 12:28:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:46,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. 28.61/19.80 [2019-03-28 12:28:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:46,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. 28.61/19.80 [2019-03-28 12:28:46,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.61/19.80 [2019-03-28 12:28:46,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 141 transitions. 28.61/19.80 [2019-03-28 12:28:46,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 28.61/19.80 [2019-03-28 12:28:46,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 30 states and 37 transitions. 28.61/19.80 [2019-03-28 12:28:46,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 28.61/19.80 [2019-03-28 12:28:46,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 28.61/19.80 [2019-03-28 12:28:46,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. 28.61/19.80 [2019-03-28 12:28:46,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.61/19.80 [2019-03-28 12:28:46,689 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. 28.61/19.80 [2019-03-28 12:28:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. 28.61/19.80 [2019-03-28 12:28:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. 28.61/19.80 [2019-03-28 12:28:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 28.61/19.80 [2019-03-28 12:28:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,692 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 28.61/19.80 [2019-03-28 12:28:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 28.61/19.80 [2019-03-28 12:28:46,692 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 5 states. 28.61/19.80 [2019-03-28 12:28:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.61/19.80 [2019-03-28 12:28:46,721 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. 28.61/19.80 [2019-03-28 12:28:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 28.61/19.80 [2019-03-28 12:28:46,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. 28.61/19.80 [2019-03-28 12:28:46,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 28.61/19.80 [2019-03-28 12:28:46,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. 28.61/19.80 [2019-03-28 12:28:46,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 28.61/19.80 [2019-03-28 12:28:46,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 28.61/19.80 [2019-03-28 12:28:46,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. 28.61/19.80 [2019-03-28 12:28:46,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.61/19.80 [2019-03-28 12:28:46,726 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. 28.61/19.80 [2019-03-28 12:28:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. 28.61/19.80 [2019-03-28 12:28:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. 28.61/19.80 [2019-03-28 12:28:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 28.61/19.80 [2019-03-28 12:28:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,728 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,728 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,728 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 28.61/19.80 [2019-03-28 12:28:46,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. 28.61/19.80 [2019-03-28 12:28:46,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 28.61/19.80 [2019-03-28 12:28:46,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.61/19.80 [2019-03-28 12:28:46,729 INFO L119 BuchiIsEmpty]: Starting construction of run 28.61/19.80 [2019-03-28 12:28:46,729 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:46,730 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] 28.61/19.80 [2019-03-28 12:28:46,730 INFO L794 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY [91] ULTIMATE.startENTRY-->L35: Formula: (and (<= v_ULTIMATE.start_main_~m~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~n~0_11) (<= v_ULTIMATE.start_main_~n~0_11 2147483647) (<= 0 v_ULTIMATE.start_main_~m~0_11)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_11, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 536#L35 [68] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_9) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_8)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 535#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 537#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 549#L17 [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 539#L18 [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 538#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 541#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 548#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 542#L20 28.61/19.80 [2019-03-28 12:28:46,730 INFO L796 eck$LassoCheckResult]: Loop: 542#L20 [49] L20-->L21: Formula: (< v_addition_~n_3 0) InVars {addition_~n=v_addition_~n_3} OutVars{addition_~n=v_addition_~n_3} AuxVars[] AssignedVars[] 544#L21 [52] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 546#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 555#L14 [85] L14-->L17: Formula: (< 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 551#L17 [57] L17-->L18: Formula: (< 0 v_addition_~n_9) InVars {addition_~n=v_addition_~n_9} OutVars{addition_~n=v_addition_~n_9} AuxVars[] AssignedVars[] 543#L18 [56] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 550#additionENTRY [60] additionENTRY-->L14: Formula: (and (= v_addition_~n_5 |v_addition_#in~n_1|) (= v_addition_~m_3 |v_addition_#in~m_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_5, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_3} AuxVars[] AssignedVars[addition_~n, addition_~m] 554#L14 [86] L14-->L17: Formula: (> 0 v_addition_~n_8) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 553#L17 [78] L17-->L20: Formula: (>= 0 v_addition_~n_2) InVars {addition_~n=v_addition_~n_2} OutVars{addition_~n=v_addition_~n_2} AuxVars[] AssignedVars[] 542#L20 28.61/19.80 [2019-03-28 12:28:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash 984366642, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:46,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:46,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.61/19.80 [2019-03-28 12:28:46,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 28.61/19.80 [2019-03-28 12:28:46,755 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.61/19.80 [2019-03-28 12:28:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.61/19.80 [2019-03-28 12:28:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1767848472, now seen corresponding path program 1 times 28.61/19.80 [2019-03-28 12:28:46,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.61/19.80 [2019-03-28 12:28:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.61/19.80 [2019-03-28 12:28:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.61/19.80 [2019-03-28 12:28:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.61/19.80 [2019-03-28 12:28:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 28.61/19.80 [2019-03-28 12:28:46,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.61/19.80 [2019-03-28 12:28:46,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 28.61/19.80 [2019-03-28 12:28:46,778 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.61/19.80 [2019-03-28 12:28:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 28.61/19.80 [2019-03-28 12:28:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 28.61/19.80 [2019-03-28 12:28:46,779 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 5 states. 28.61/19.80 [2019-03-28 12:28:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.61/19.80 [2019-03-28 12:28:46,812 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. 28.61/19.80 [2019-03-28 12:28:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 28.61/19.80 [2019-03-28 12:28:46,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. 28.61/19.80 [2019-03-28 12:28:46,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.61/19.80 [2019-03-28 12:28:46,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 28.61/19.80 [2019-03-28 12:28:46,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 28.61/19.80 [2019-03-28 12:28:46,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 28.61/19.80 [2019-03-28 12:28:46,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 28.61/19.80 [2019-03-28 12:28:46,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.61/19.80 [2019-03-28 12:28:46,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 28.61/19.80 [2019-03-28 12:28:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:28:46 BasicIcfg 28.61/19.80 [2019-03-28 12:28:46,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 28.61/19.80 [2019-03-28 12:28:46,823 INFO L168 Benchmark]: Toolchain (without parser) took 15334.75 ms. Allocated memory was 649.6 MB in the beginning and 755.0 MB in the end (delta: 105.4 MB). Free memory was 564.6 MB in the beginning and 662.7 MB in the end (delta: -98.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,824 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.58 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 563.6 MB in the beginning and 658.2 MB in the end (delta: -94.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 690.5 MB. Free memory was 658.2 MB in the beginning and 657.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,826 INFO L168 Benchmark]: Boogie Preprocessor took 17.67 ms. Allocated memory is still 690.5 MB. Free memory was 657.1 MB in the beginning and 656.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,827 INFO L168 Benchmark]: RCFGBuilder took 221.06 ms. Allocated memory is still 690.5 MB. Free memory was 656.0 MB in the beginning and 638.3 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,827 INFO L168 Benchmark]: BlockEncodingV2 took 90.37 ms. Allocated memory is still 690.5 MB. Free memory was 638.3 MB in the beginning and 632.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,828 INFO L168 Benchmark]: TraceAbstraction took 173.42 ms. Allocated memory is still 690.5 MB. Free memory was 631.9 MB in the beginning and 622.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,828 INFO L168 Benchmark]: BuchiAutomizer took 14509.35 ms. Allocated memory was 690.5 MB in the beginning and 755.0 MB in the end (delta: 64.5 MB). Free memory was 621.1 MB in the beginning and 662.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 50.3 GB. 28.61/19.80 [2019-03-28 12:28:46,832 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 28.61/19.80 --- Results --- 28.61/19.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 28.61/19.80 - StatisticsResult: Initial Icfg 28.61/19.80 20 locations, 27 edges 28.61/19.80 - StatisticsResult: Encoded RCFG 28.61/19.80 12 locations, 17 edges 28.61/19.80 * Results from de.uni_freiburg.informatik.ultimate.core: 28.61/19.80 - StatisticsResult: Toolchain Benchmarks 28.61/19.80 Benchmark results are: 28.61/19.80 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.61/19.80 * CACSL2BoogieTranslator took 282.58 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 563.6 MB in the beginning and 658.2 MB in the end (delta: -94.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 28.61/19.80 * Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 690.5 MB. Free memory was 658.2 MB in the beginning and 657.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.61/19.80 * Boogie Preprocessor took 17.67 ms. Allocated memory is still 690.5 MB. Free memory was 657.1 MB in the beginning and 656.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 28.61/19.80 * RCFGBuilder took 221.06 ms. Allocated memory is still 690.5 MB. Free memory was 656.0 MB in the beginning and 638.3 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 50.3 GB. 28.61/19.80 * BlockEncodingV2 took 90.37 ms. Allocated memory is still 690.5 MB. Free memory was 638.3 MB in the beginning and 632.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 28.61/19.80 * TraceAbstraction took 173.42 ms. Allocated memory is still 690.5 MB. Free memory was 631.9 MB in the beginning and 622.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 28.61/19.80 * BuchiAutomizer took 14509.35 ms. Allocated memory was 690.5 MB in the beginning and 755.0 MB in the end (delta: 64.5 MB). Free memory was 621.1 MB in the beginning and 662.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 50.3 GB. 28.61/19.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 28.61/19.80 - AllSpecificationsHoldResult: All specifications hold 28.61/19.80 We were not able to verify any specifiation because the program does not contain any specification. 28.61/19.80 - StatisticsResult: Ultimate Automizer benchmark data 28.61/19.80 CFG has 2 procedures, 12 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=12occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 28.61/19.80 - StatisticsResult: Constructed decomposition of program 28.61/19.80 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * n and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 28.61/19.80 - StatisticsResult: Timing statistics 28.61/19.80 BüchiAutomizer plugin needed 14.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46 SDtfs, 71 SDslu, 40 SDs, 0 SdLazy, 130 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.5s 28.61/19.80 - TerminationAnalysisResult: Termination proven 28.61/19.80 Buchi Automizer proved that your program is terminating 28.61/19.80 RESULT: Ultimate proved your program to be correct! 28.61/19.80 !SESSION 2019-03-28 12:28:28.227 ----------------------------------------------- 28.61/19.80 eclipse.buildId=unknown 28.61/19.80 java.version=1.8.0_181 28.61/19.80 java.vendor=Oracle Corporation 28.61/19.80 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 28.61/19.80 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.61/19.80 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 28.61/19.80 28.61/19.80 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:28:47.063 28.61/19.80 !MESSAGE The workspace will exit with unsaved changes in this session. 28.61/19.80 Received shutdown request... 28.61/19.80 Ultimate: 28.61/19.80 GTK+ Version Check 28.61/19.80 EOF