76.13/36.01 NO 76.13/36.01 76.13/36.01 Ultimate: Cannot open display: 76.13/36.01 This is Ultimate 0.1.24-8dc7c08-m 76.13/36.01 [2019-03-28 11:57:00,215 INFO L170 SettingsManager]: Resetting all preferences to default values... 76.13/36.01 [2019-03-28 11:57:00,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 76.13/36.01 [2019-03-28 11:57:00,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 76.13/36.01 [2019-03-28 11:57:00,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 76.13/36.01 [2019-03-28 11:57:00,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 76.13/36.01 [2019-03-28 11:57:00,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 76.13/36.01 [2019-03-28 11:57:00,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 76.13/36.01 [2019-03-28 11:57:00,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 76.13/36.01 [2019-03-28 11:57:00,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 76.13/36.01 [2019-03-28 11:57:00,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 76.13/36.01 [2019-03-28 11:57:00,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 76.13/36.01 [2019-03-28 11:57:00,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 76.13/36.01 [2019-03-28 11:57:00,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 76.13/36.01 [2019-03-28 11:57:00,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 76.13/36.01 [2019-03-28 11:57:00,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 76.13/36.01 [2019-03-28 11:57:00,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 76.13/36.01 [2019-03-28 11:57:00,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 76.13/36.01 [2019-03-28 11:57:00,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 76.13/36.01 [2019-03-28 11:57:00,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 76.13/36.01 [2019-03-28 11:57:00,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 76.13/36.01 [2019-03-28 11:57:00,252 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 76.13/36.01 [2019-03-28 11:57:00,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 76.13/36.01 [2019-03-28 11:57:00,253 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 76.13/36.01 [2019-03-28 11:57:00,254 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 76.13/36.01 [2019-03-28 11:57:00,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 76.13/36.01 [2019-03-28 11:57:00,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 76.13/36.01 [2019-03-28 11:57:00,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 76.13/36.01 [2019-03-28 11:57:00,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 76.13/36.01 [2019-03-28 11:57:00,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 76.13/36.01 [2019-03-28 11:57:00,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 76.13/36.01 [2019-03-28 11:57:00,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 76.13/36.01 [2019-03-28 11:57:00,259 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 76.13/36.01 [2019-03-28 11:57:00,274 INFO L110 SettingsManager]: Loading preferences was successful 76.13/36.01 [2019-03-28 11:57:00,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 76.13/36.01 [2019-03-28 11:57:00,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 76.13/36.01 [2019-03-28 11:57:00,275 INFO L133 SettingsManager]: * Rewrite not-equals=true 76.13/36.01 [2019-03-28 11:57:00,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 76.13/36.01 [2019-03-28 11:57:00,275 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 76.13/36.01 [2019-03-28 11:57:00,276 INFO L133 SettingsManager]: * Use SBE=true 76.13/36.01 [2019-03-28 11:57:00,276 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 76.13/36.01 [2019-03-28 11:57:00,276 INFO L133 SettingsManager]: * Use old map elimination=false 76.13/36.01 [2019-03-28 11:57:00,276 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 76.13/36.01 [2019-03-28 11:57:00,276 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 76.13/36.01 [2019-03-28 11:57:00,277 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 76.13/36.01 [2019-03-28 11:57:00,277 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 76.13/36.01 [2019-03-28 11:57:00,277 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 76.13/36.01 [2019-03-28 11:57:00,277 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:00,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 76.13/36.01 [2019-03-28 11:57:00,277 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 76.13/36.01 [2019-03-28 11:57:00,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE 76.13/36.01 [2019-03-28 11:57:00,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 76.13/36.01 [2019-03-28 11:57:00,278 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 76.13/36.01 [2019-03-28 11:57:00,278 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 76.13/36.01 [2019-03-28 11:57:00,278 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 76.13/36.01 [2019-03-28 11:57:00,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 76.13/36.01 [2019-03-28 11:57:00,279 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 76.13/36.01 [2019-03-28 11:57:00,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 76.13/36.01 [2019-03-28 11:57:00,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 76.13/36.01 [2019-03-28 11:57:00,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 76.13/36.01 [2019-03-28 11:57:00,279 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 76.13/36.01 [2019-03-28 11:57:00,279 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 76.13/36.01 [2019-03-28 11:57:00,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 76.13/36.01 [2019-03-28 11:57:00,318 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 76.13/36.01 [2019-03-28 11:57:00,322 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 76.13/36.01 [2019-03-28 11:57:00,323 INFO L271 PluginConnector]: Initializing CDTParser... 76.13/36.01 [2019-03-28 11:57:00,324 INFO L276 PluginConnector]: CDTParser initialized 76.13/36.01 [2019-03-28 11:57:00,325 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 76.13/36.01 [2019-03-28 11:57:00,396 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/b3c2ed8ca23541be89d191f0160fd248/FLAG96b840ff0 76.13/36.01 [2019-03-28 11:57:00,729 INFO L307 CDTParser]: Found 1 translation units. 76.13/36.01 [2019-03-28 11:57:00,730 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 76.13/36.01 [2019-03-28 11:57:00,737 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/b3c2ed8ca23541be89d191f0160fd248/FLAG96b840ff0 76.13/36.01 [2019-03-28 11:57:01,146 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/b3c2ed8ca23541be89d191f0160fd248 76.13/36.01 [2019-03-28 11:57:01,157 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 76.13/36.01 [2019-03-28 11:57:01,159 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 76.13/36.01 [2019-03-28 11:57:01,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 76.13/36.01 [2019-03-28 11:57:01,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 76.13/36.01 [2019-03-28 11:57:01,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 76.13/36.01 [2019-03-28 11:57:01,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557d3f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 76.13/36.01 [2019-03-28 11:57:01,193 INFO L176 MainTranslator]: Built tables and reachable declarations 76.13/36.01 [2019-03-28 11:57:01,349 INFO L206 PostProcessor]: Analyzing one entry point: main 76.13/36.01 [2019-03-28 11:57:01,353 INFO L191 MainTranslator]: Completed pre-run 76.13/36.01 [2019-03-28 11:57:01,369 INFO L206 PostProcessor]: Analyzing one entry point: main 76.13/36.01 [2019-03-28 11:57:01,437 INFO L195 MainTranslator]: Completed translation 76.13/36.01 [2019-03-28 11:57:01,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01 WrapperNode 76.13/36.01 [2019-03-28 11:57:01,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 76.13/36.01 [2019-03-28 11:57:01,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 76.13/36.01 [2019-03-28 11:57:01,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 76.13/36.01 [2019-03-28 11:57:01,439 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 76.13/36.01 [2019-03-28 11:57:01,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 76.13/36.01 [2019-03-28 11:57:01,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 76.13/36.01 [2019-03-28 11:57:01,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 76.13/36.01 [2019-03-28 11:57:01,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized 76.13/36.01 [2019-03-28 11:57:01,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 76.13/36.01 [2019-03-28 11:57:01,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 76.13/36.01 [2019-03-28 11:57:01,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... 76.13/36.01 [2019-03-28 11:57:01,490 INFO L276 PluginConnector]: RCFGBuilder initialized 76.13/36.01 [2019-03-28 11:57:01,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (1/1) ... 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 76.13/36.01 [2019-03-28 11:57:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure rec 76.13/36.01 [2019-03-28 11:57:01,553 INFO L138 BoogieDeclarations]: Found implementation of procedure rec 76.13/36.01 [2019-03-28 11:57:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 76.13/36.01 [2019-03-28 11:57:01,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 76.13/36.01 [2019-03-28 11:57:01,697 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 76.13/36.01 [2019-03-28 11:57:01,698 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 76.13/36.01 [2019-03-28 11:57:01,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:01 BoogieIcfgContainer 76.13/36.01 [2019-03-28 11:57:01,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 76.13/36.01 [2019-03-28 11:57:01,700 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 76.13/36.01 [2019-03-28 11:57:01,700 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 76.13/36.01 [2019-03-28 11:57:01,702 INFO L276 PluginConnector]: BlockEncodingV2 initialized 76.13/36.01 [2019-03-28 11:57:01,703 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:01" (1/1) ... 76.13/36.01 [2019-03-28 11:57:01,720 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges 76.13/36.01 [2019-03-28 11:57:01,722 INFO L258 BlockEncoder]: Using Remove infeasible edges 76.13/36.01 [2019-03-28 11:57:01,722 INFO L263 BlockEncoder]: Using Maximize final states 76.13/36.01 [2019-03-28 11:57:01,723 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 76.13/36.01 [2019-03-28 11:57:01,723 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 76.13/36.01 [2019-03-28 11:57:01,725 INFO L296 BlockEncoder]: Using Remove sink states 76.13/36.01 [2019-03-28 11:57:01,726 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 76.13/36.01 [2019-03-28 11:57:01,726 INFO L179 BlockEncoder]: Using Rewrite not-equals 76.13/36.01 [2019-03-28 11:57:01,743 INFO L185 BlockEncoder]: Using Use SBE 76.13/36.01 [2019-03-28 11:57:01,767 INFO L200 BlockEncoder]: SBE split 2 edges 76.13/36.01 [2019-03-28 11:57:01,771 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 76.13/36.01 [2019-03-28 11:57:01,773 INFO L71 MaximizeFinalStates]: 0 new accepting states 76.13/36.01 [2019-03-28 11:57:01,782 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 76.13/36.01 [2019-03-28 11:57:01,784 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 76.13/36.01 [2019-03-28 11:57:01,786 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 76.13/36.01 [2019-03-28 11:57:01,787 INFO L71 MaximizeFinalStates]: 0 new accepting states 76.13/36.01 [2019-03-28 11:57:01,787 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 76.13/36.01 [2019-03-28 11:57:01,787 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 76.13/36.01 [2019-03-28 11:57:01,788 INFO L313 BlockEncoder]: Encoded RCFG 13 locations, 34 edges 76.13/36.01 [2019-03-28 11:57:01,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:01 BasicIcfg 76.13/36.01 [2019-03-28 11:57:01,788 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 76.13/36.01 [2019-03-28 11:57:01,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 76.13/36.01 [2019-03-28 11:57:01,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... 76.13/36.01 [2019-03-28 11:57:01,792 INFO L276 PluginConnector]: TraceAbstraction initialized 76.13/36.01 [2019-03-28 11:57:01,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:57:01" (1/4) ... 76.13/36.01 [2019-03-28 11:57:01,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e919f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (2/4) ... 76.13/36.01 [2019-03-28 11:57:01,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e919f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:01" (3/4) ... 76.13/36.01 [2019-03-28 11:57:01,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e919f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:01" (4/4) ... 76.13/36.01 [2019-03-28 11:57:01,797 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 76.13/36.01 [2019-03-28 11:57:01,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 76.13/36.01 [2019-03-28 11:57:01,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 76.13/36.01 [2019-03-28 11:57:01,832 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 76.13/36.01 [2019-03-28 11:57:01,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation 76.13/36.01 [2019-03-28 11:57:01,860 INFO L382 AbstractCegarLoop]: Interprodecural is true 76.13/36.01 [2019-03-28 11:57:01,861 INFO L383 AbstractCegarLoop]: Hoare is true 76.13/36.01 [2019-03-28 11:57:01,861 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 76.13/36.01 [2019-03-28 11:57:01,861 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 76.13/36.01 [2019-03-28 11:57:01,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 76.13/36.01 [2019-03-28 11:57:01,861 INFO L387 AbstractCegarLoop]: Difference is false 76.13/36.01 [2019-03-28 11:57:01,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 76.13/36.01 [2019-03-28 11:57:01,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 76.13/36.01 [2019-03-28 11:57:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. 76.13/36.01 [2019-03-28 11:57:01,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 76.13/36.01 [2019-03-28 11:57:01,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. 76.13/36.01 [2019-03-28 11:57:01,952 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true 76.13/36.01 [2019-03-28 11:57:01,952 INFO L451 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: true 76.13/36.01 [2019-03-28 11:57:01,953 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,953 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,953 INFO L451 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: true 76.13/36.01 [2019-03-28 11:57:01,953 INFO L451 ceAbstractionStarter]: At program point recENTRY(lines 9 18) the Hoare annotation is: true 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point recFINAL(lines 9 18) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 17) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point recEXIT(lines 9 18) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 76.13/36.01 [2019-03-28 11:57:01,955 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true 76.13/36.01 [2019-03-28 11:57:01,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:01 BasicIcfg 76.13/36.01 [2019-03-28 11:57:01,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 76.13/36.01 [2019-03-28 11:57:01,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 76.13/36.01 [2019-03-28 11:57:01,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 76.13/36.01 [2019-03-28 11:57:01,963 INFO L276 PluginConnector]: BuchiAutomizer initialized 76.13/36.01 [2019-03-28 11:57:01,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 76.13/36.01 [2019-03-28 11:57:01,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:57:01" (1/5) ... 76.13/36.01 [2019-03-28 11:57:01,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c56499e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 76.13/36.01 [2019-03-28 11:57:01,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:57:01" (2/5) ... 76.13/36.01 [2019-03-28 11:57:01,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c56499e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 76.13/36.01 [2019-03-28 11:57:01,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:57:01" (3/5) ... 76.13/36.01 [2019-03-28 11:57:01,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c56499e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 76.13/36.01 [2019-03-28 11:57:01,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:57:01" (4/5) ... 76.13/36.01 [2019-03-28 11:57:01,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c56499e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:01, skipping insertion in model container 76.13/36.01 [2019-03-28 11:57:01,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 76.13/36.01 [2019-03-28 11:57:01,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:57:01" (5/5) ... 76.13/36.01 [2019-03-28 11:57:01,969 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 76.13/36.01 [2019-03-28 11:57:02,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation 76.13/36.01 [2019-03-28 11:57:02,000 INFO L374 BuchiCegarLoop]: Interprodecural is true 76.13/36.01 [2019-03-28 11:57:02,000 INFO L375 BuchiCegarLoop]: Hoare is true 76.13/36.01 [2019-03-28 11:57:02,001 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 76.13/36.01 [2019-03-28 11:57:02,001 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 76.13/36.01 [2019-03-28 11:57:02,001 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 76.13/36.01 [2019-03-28 11:57:02,001 INFO L379 BuchiCegarLoop]: Difference is false 76.13/36.01 [2019-03-28 11:57:02,001 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 76.13/36.01 [2019-03-28 11:57:02,001 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 76.13/36.01 [2019-03-28 11:57:02,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. 76.13/36.01 [2019-03-28 11:57:02,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:02,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.01 [2019-03-28 11:57:02,029 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.01 [2019-03-28 11:57:02,036 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 76.13/36.01 [2019-03-28 11:57:02,036 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 76.13/36.01 [2019-03-28 11:57:02,037 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 76.13/36.01 [2019-03-28 11:57:02,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. 76.13/36.01 [2019-03-28 11:57:02,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:02,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.01 [2019-03-28 11:57:02,039 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.01 [2019-03-28 11:57:02,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 76.13/36.01 [2019-03-28 11:57:02,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 76.13/36.01 [2019-03-28 11:57:02,045 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 13#L23true [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 4#recENTRYtrue 76.13/36.01 [2019-03-28 11:57:02,047 INFO L796 eck$LassoCheckResult]: Loop: 4#recENTRYtrue [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 15#L10true [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 6#L12true [55] L12-->L13: Formula: (let ((.cse0 (mod v_rec_~x_4 2))) (and (< .cse0 0) (= 0 (+ .cse0 (- 2))) (< v_rec_~x_4 0))) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 5#L13true [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 4#recENTRYtrue 76.13/36.01 [2019-03-28 11:57:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:02,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:02,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1928543, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:02,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:02,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.01 [2019-03-28 11:57:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 76.13/36.01 [2019-03-28 11:57:02,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 76.13/36.01 [2019-03-28 11:57:02,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 76.13/36.01 [2019-03-28 11:57:02,195 INFO L811 eck$LassoCheckResult]: loop already infeasible 76.13/36.01 [2019-03-28 11:57:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 76.13/36.01 [2019-03-28 11:57:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 76.13/36.01 [2019-03-28 11:57:02,214 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. 76.13/36.01 [2019-03-28 11:57:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 76.13/36.01 [2019-03-28 11:57:02,280 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 76.13/36.01 [2019-03-28 11:57:02,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:02,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 76.13/36.01 [2019-03-28 11:57:02,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 76.13/36.01 [2019-03-28 11:57:02,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 76.13/36.01 [2019-03-28 11:57:02,299 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. 76.13/36.01 [2019-03-28 11:57:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. 76.13/36.01 [2019-03-28 11:57:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 76.13/36.01 [2019-03-28 11:57:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 76.13/36.01 [2019-03-28 11:57:02,331 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 76.13/36.01 [2019-03-28 11:57:02,331 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 76.13/36.01 [2019-03-28 11:57:02,331 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 76.13/36.01 [2019-03-28 11:57:02,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. 76.13/36.01 [2019-03-28 11:57:02,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:02,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.01 [2019-03-28 11:57:02,332 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.01 [2019-03-28 11:57:02,333 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 76.13/36.01 [2019-03-28 11:57:02,333 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 76.13/36.01 [2019-03-28 11:57:02,333 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 41#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 42#recENTRY 76.13/36.01 [2019-03-28 11:57:02,334 INFO L796 eck$LassoCheckResult]: Loop: 42#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 43#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 44#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 39#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 42#recENTRY 76.13/36.01 [2019-03-28 11:57:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 2 times 76.13/36.01 [2019-03-28 11:57:02,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:02,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1928605, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:02,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:02,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2102015359, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:02,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:02,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:02,465 INFO L216 LassoAnalysis]: Preferences: 76.13/36.01 [2019-03-28 11:57:02,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.01 [2019-03-28 11:57:02,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.01 [2019-03-28 11:57:02,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.01 [2019-03-28 11:57:02,467 INFO L127 ssoRankerPreferences]: Use exernal solver: true 76.13/36.01 [2019-03-28 11:57:02,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.01 [2019-03-28 11:57:02,467 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.01 [2019-03-28 11:57:02,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 76.13/36.01 [2019-03-28 11:57:02,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.01 [2019-03-28 11:57:02,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.01 [2019-03-28 11:57:02,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,622 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.01 [2019-03-28 11:57:02,623 INFO L412 LassoAnalysis]: Checking for nontermination... 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:02,632 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:02,641 INFO L445 LassoAnalysis]: Proved nontermination for one component. 76.13/36.01 [2019-03-28 11:57:02,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret0=0} Honda state: {rec_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:02,674 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:02,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. 76.13/36.01 [2019-03-28 11:57:02,678 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_#t~ret2=0} Honda state: {rec_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:02,725 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:02,730 INFO L445 LassoAnalysis]: Proved nontermination for one component. 76.13/36.01 [2019-03-28 11:57:02,730 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~x=0} Honda state: {rec_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:02,759 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:02,796 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:02,844 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 76.13/36.01 [2019-03-28 11:57:02,846 INFO L216 LassoAnalysis]: Preferences: 76.13/36.01 [2019-03-28 11:57:02,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.01 [2019-03-28 11:57:02,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.01 [2019-03-28 11:57:02,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.01 [2019-03-28 11:57:02,847 INFO L127 ssoRankerPreferences]: Use exernal solver: false 76.13/36.01 [2019-03-28 11:57:02,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:02,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.01 [2019-03-28 11:57:02,847 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.01 [2019-03-28 11:57:02,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 76.13/36.01 [2019-03-28 11:57:02,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.01 [2019-03-28 11:57:02,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.01 [2019-03-28 11:57:02,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:02,960 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.01 [2019-03-28 11:57:02,966 INFO L497 LassoAnalysis]: Using template 'affine'. 76.13/36.01 [2019-03-28 11:57:02,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:02,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:02,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:02,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:02,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:02,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:02,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:02,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:02,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:02,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:02,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:02,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:02,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:02,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:02,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:02,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:02,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:02,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:02,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:02,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:02,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:02,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:02,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:02,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:02,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:02,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:02,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:02,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:02,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:02,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:02,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:02,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:02,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:02,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:02,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:02,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 76.13/36.01 [2019-03-28 11:57:03,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 76.13/36.01 [2019-03-28 11:57:03,002 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 76.13/36.01 [2019-03-28 11:57:03,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 76.13/36.01 [2019-03-28 11:57:03,004 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 76.13/36.01 [2019-03-28 11:57:03,005 INFO L518 LassoAnalysis]: Proved termination. 76.13/36.01 [2019-03-28 11:57:03,005 INFO L520 LassoAnalysis]: Termination argument consisting of: 76.13/36.01 Ranking function f(rec_#in~x) = 1*rec_#in~x 76.13/36.01 Supporting invariants [] 76.13/36.01 [2019-03-28 11:57:03,006 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 76.13/36.01 [2019-03-28 11:57:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.01 [2019-03-28 11:57:03,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 76.13/36.01 [2019-03-28 11:57:03,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.01 [2019-03-28 11:57:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.01 [2019-03-28 11:57:03,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core 76.13/36.01 [2019-03-28 11:57:03,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.01 [2019-03-28 11:57:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 76.13/36.01 [2019-03-28 11:57:03,113 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 76.13/36.01 [2019-03-28 11:57:03,116 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 76.13/36.01 [2019-03-28 11:57:03,117 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. 76.13/36.01 [2019-03-28 11:57:03,243 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 51 states and 70 transitions. Complement of second has 20 states. 76.13/36.01 [2019-03-28 11:57:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 76.13/36.01 [2019-03-28 11:57:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 76.13/36.01 [2019-03-28 11:57:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 76.13/36.01 [2019-03-28 11:57:03,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. 76.13/36.01 [2019-03-28 11:57:03,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.01 [2019-03-28 11:57:03,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. 76.13/36.01 [2019-03-28 11:57:03,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.01 [2019-03-28 11:57:03,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 8 letters. 76.13/36.01 [2019-03-28 11:57:03,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.01 [2019-03-28 11:57:03,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 70 transitions. 76.13/36.01 [2019-03-28 11:57:03,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:03,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 27 states and 38 transitions. 76.13/36.01 [2019-03-28 11:57:03,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 76.13/36.01 [2019-03-28 11:57:03,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 76.13/36.01 [2019-03-28 11:57:03,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. 76.13/36.01 [2019-03-28 11:57:03,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 76.13/36.01 [2019-03-28 11:57:03,265 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. 76.13/36.01 [2019-03-28 11:57:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. 76.13/36.01 [2019-03-28 11:57:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. 76.13/36.01 [2019-03-28 11:57:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 76.13/36.01 [2019-03-28 11:57:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. 76.13/36.01 [2019-03-28 11:57:03,269 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 76.13/36.01 [2019-03-28 11:57:03,269 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 76.13/36.01 [2019-03-28 11:57:03,269 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 76.13/36.01 [2019-03-28 11:57:03,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. 76.13/36.01 [2019-03-28 11:57:03,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 76.13/36.01 [2019-03-28 11:57:03,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.01 [2019-03-28 11:57:03,271 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.01 [2019-03-28 11:57:03,271 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 76.13/36.01 [2019-03-28 11:57:03,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 76.13/36.01 [2019-03-28 11:57:03,271 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 166#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 169#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 171#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 174#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 164#L15 76.13/36.01 [2019-03-28 11:57:03,272 INFO L796 eck$LassoCheckResult]: Loop: 164#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 173#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 182#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 181#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 164#L15 76.13/36.01 [2019-03-28 11:57:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:03,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:03,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:03,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.01 [2019-03-28 11:57:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.01 [2019-03-28 11:57:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash 519336230, now seen corresponding path program 1 times 76.13/36.01 [2019-03-28 11:57:03,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.01 [2019-03-28 11:57:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.01 [2019-03-28 11:57:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.01 [2019-03-28 11:57:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.01 [2019-03-28 11:57:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 76.13/36.01 [2019-03-28 11:57:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 76.13/36.01 [2019-03-28 11:57:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 76.13/36.01 [2019-03-28 11:57:03,440 INFO L216 LassoAnalysis]: Preferences: 76.13/36.01 [2019-03-28 11:57:03,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.01 [2019-03-28 11:57:03,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.01 [2019-03-28 11:57:03,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.01 [2019-03-28 11:57:03,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true 76.13/36.01 [2019-03-28 11:57:03,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:03,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.01 [2019-03-28 11:57:03,441 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.01 [2019-03-28 11:57:03,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 76.13/36.01 [2019-03-28 11:57:03,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.01 [2019-03-28 11:57:03,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.01 [2019-03-28 11:57:03,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:03,569 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.01 [2019-03-28 11:57:03,570 INFO L412 LassoAnalysis]: Checking for nontermination... 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:03,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:03,574 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:03,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. 76.13/36.01 [2019-03-28 11:57:03,579 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec_~store~0=0} Honda state: {rec_~store~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:03,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:03,612 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.01 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.01 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:03,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 76.13/36.01 [2019-03-28 11:57:03,650 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.01 [2019-03-28 11:57:08,330 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 76.13/36.01 [2019-03-28 11:57:08,380 INFO L216 LassoAnalysis]: Preferences: 76.13/36.01 [2019-03-28 11:57:08,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.01 [2019-03-28 11:57:08,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.01 [2019-03-28 11:57:08,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.01 [2019-03-28 11:57:08,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false 76.13/36.01 [2019-03-28 11:57:08,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 76.13/36.01 [2019-03-28 11:57:08,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.01 [2019-03-28 11:57:08,382 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.01 [2019-03-28 11:57:08,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 76.13/36.01 [2019-03-28 11:57:08,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.01 [2019-03-28 11:57:08,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.01 [2019-03-28 11:57:08,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.01 [2019-03-28 11:57:08,489 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.01 [2019-03-28 11:57:08,490 INFO L497 LassoAnalysis]: Using template 'affine'. 76.13/36.01 [2019-03-28 11:57:08,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,521 INFO L497 LassoAnalysis]: Using template '2-nested'. 76.13/36.01 [2019-03-28 11:57:08,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,523 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,525 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,539 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,542 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,542 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,545 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,545 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,548 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,548 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,569 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,576 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,577 INFO L497 LassoAnalysis]: Using template '3-nested'. 76.13/36.01 [2019-03-28 11:57:08,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,597 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,600 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,609 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,610 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,614 INFO L497 LassoAnalysis]: Using template '4-nested'. 76.13/36.01 [2019-03-28 11:57:08,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,615 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,617 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,635 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,636 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,642 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.01 [2019-03-28 11:57:08,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.01 [2019-03-28 11:57:08,645 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.01 [2019-03-28 11:57:08,646 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.01 [2019-03-28 11:57:08,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.01 [2019-03-28 11:57:08,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.01 [2019-03-28 11:57:08,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.01 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.01 Number of strict supporting invariants: 0 76.13/36.01 Number of non-strict supporting invariants: 1 76.13/36.01 Consider only non-deceasing supporting invariants: true 76.13/36.01 Simplify termination arguments: true 76.13/36.01 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.01 [2019-03-28 11:57:08,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.01 [2019-03-28 11:57:08,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.01 [2019-03-28 11:57:08,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,649 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.02 [2019-03-28 11:57:08,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,652 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,654 INFO L497 LassoAnalysis]: Using template '2-phase'. 76.13/36.02 [2019-03-28 11:57:08,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,657 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,689 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,691 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,694 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,695 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,696 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,697 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,698 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,699 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,701 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,703 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,703 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,706 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,707 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,708 INFO L497 LassoAnalysis]: Using template '3-phase'. 76.13/36.02 [2019-03-28 11:57:08,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,709 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,763 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,768 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,773 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,782 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,783 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,787 INFO L339 nArgumentSynthesizer]: Template has degree 2. 76.13/36.02 [2019-03-28 11:57:08,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,791 INFO L497 LassoAnalysis]: Using template '4-phase'. 76.13/36.02 [2019-03-28 11:57:08,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,792 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,797 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,871 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,871 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,872 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,877 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,880 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,883 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,884 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,890 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,892 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,893 INFO L497 LassoAnalysis]: Using template '2-lex'. 76.13/36.02 [2019-03-28 11:57:08,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,908 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,912 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,913 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. 76.13/36.02 [2019-03-28 11:57:08,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,933 INFO L497 LassoAnalysis]: Using template '3-lex'. 76.13/36.02 [2019-03-28 11:57:08,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,934 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,966 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,967 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,973 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,979 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,979 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,985 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,986 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,991 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,992 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:08,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:08,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:08,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. 76.13/36.02 [2019-03-28 11:57:08,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. 76.13/36.02 [2019-03-28 11:57:08,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:08,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:08,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:08,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. 76.13/36.02 [2019-03-28 11:57:08,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:08,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:09,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 76.13/36.02 [2019-03-28 11:57:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 76.13/36.02 [2019-03-28 11:57:09,003 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 10 Second operand 5 states. 76.13/36.02 [2019-03-28 11:57:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 76.13/36.02 [2019-03-28 11:57:09,086 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 76.13/36.02 [2019-03-28 11:57:09,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 76.13/36.02 [2019-03-28 11:57:09,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 76.13/36.02 [2019-03-28 11:57:09,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 76.13/36.02 [2019-03-28 11:57:09,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 76.13/36.02 [2019-03-28 11:57:09,093 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. 76.13/36.02 [2019-03-28 11:57:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. 76.13/36.02 [2019-03-28 11:57:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 76.13/36.02 [2019-03-28 11:57:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. 76.13/36.02 [2019-03-28 11:57:09,098 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. 76.13/36.02 [2019-03-28 11:57:09,098 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. 76.13/36.02 [2019-03-28 11:57:09,098 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 76.13/36.02 [2019-03-28 11:57:09,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. 76.13/36.02 [2019-03-28 11:57:09,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 76.13/36.02 [2019-03-28 11:57:09,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.02 [2019-03-28 11:57:09,100 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.02 [2019-03-28 11:57:09,100 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:09,101 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:09,101 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 230#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 248#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 237#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 238#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 239#L15 76.13/36.02 [2019-03-28 11:57:09,101 INFO L796 eck$LassoCheckResult]: Loop: 239#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 243#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 251#L10 [46] L10-->recFINAL: Formula: (and (<= v_rec_~x_2 0) (= |v_rec_#res_1| v_rec_~x_2)) InVars {rec_~x=v_rec_~x_2} OutVars{rec_#res=|v_rec_#res_1|, rec_~x=v_rec_~x_2} AuxVars[] AssignedVars[rec_#res] 250#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 249#recEXIT >[49] recEXIT-->L15-1: AOR: Formula: (= |v_rec_#t~ret2_4| |v_rec_#resOutParam_2|) InVars {rec_#res=|v_rec_#resOutParam_2|} OutVars{rec_#t~ret2=|v_rec_#t~ret2_4|} AuxVars[] AssignedVars[rec_#t~ret2] LVA: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x] 227#L15-1 [31] L15-1-->L16: Formula: (let ((.cse0 (+ v_rec_~x_9 (- 1)))) (and (= v_rec_~store~0_1 |v_rec_#t~ret2_3|) (= |v_rec_#t~pre3_1| .cse0) (= v_rec_~x_8 .cse0))) InVars {rec_#t~ret2=|v_rec_#t~ret2_3|, rec_~x=v_rec_~x_9} OutVars{rec_~x=v_rec_~x_8, rec_~store~0=v_rec_~store~0_1, rec_#t~pre3=|v_rec_#t~pre3_1|, rec_#t~ret2=|v_rec_#t~ret2_2|, rec_#t~pre1=|v_rec_#t~pre1_3|} AuxVars[] AssignedVars[rec_~x, rec_~store~0, rec_#t~pre3, rec_#t~ret2, rec_#t~pre1] 229#L16 [37] L16-->recENTRY: Formula: (= |v_rec_#in~xInParam_3| |v_rec_#t~pre3_4|) InVars {rec_#t~pre3=|v_rec_#t~pre3_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_3|} AuxVars[] AssignedVars[rec_#in~x]< 233#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 234#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 253#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 239#L15 76.13/36.02 [2019-03-28 11:57:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 2 times 76.13/36.02 [2019-03-28 11:57:09,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:09,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2009414697, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:09,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:09,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1592235533, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:09,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:09,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:09,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 76.13/36.02 [2019-03-28 11:57:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 76.13/36.02 [2019-03-28 11:57:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 76.13/36.02 [2019-03-28 11:57:09,311 INFO L216 LassoAnalysis]: Preferences: 76.13/36.02 [2019-03-28 11:57:09,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.02 [2019-03-28 11:57:09,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.02 [2019-03-28 11:57:09,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.02 [2019-03-28 11:57:09,312 INFO L127 ssoRankerPreferences]: Use exernal solver: true 76.13/36.02 [2019-03-28 11:57:09,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.02 [2019-03-28 11:57:09,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.02 [2019-03-28 11:57:09,312 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.02 [2019-03-28 11:57:09,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 76.13/36.02 [2019-03-28 11:57:09,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.02 [2019-03-28 11:57:09,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.02 [2019-03-28 11:57:09,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,416 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.02 [2019-03-28 11:57:09,416 INFO L412 LassoAnalysis]: Checking for nontermination... 76.13/36.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.02 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.02 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.02 [2019-03-28 11:57:09,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 76.13/36.02 [2019-03-28 11:57:09,424 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.02 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 76.13/36.02 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 76.13/36.02 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 76.13/36.02 [2019-03-28 11:57:09,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 76.13/36.02 [2019-03-28 11:57:09,458 INFO L163 nArgumentSynthesizer]: Using integer mode. 76.13/36.02 [2019-03-28 11:57:09,969 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 76.13/36.02 [2019-03-28 11:57:09,972 INFO L216 LassoAnalysis]: Preferences: 76.13/36.02 [2019-03-28 11:57:09,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 76.13/36.02 [2019-03-28 11:57:09,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 76.13/36.02 [2019-03-28 11:57:09,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 76.13/36.02 [2019-03-28 11:57:09,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false 76.13/36.02 [2019-03-28 11:57:09,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 76.13/36.02 [2019-03-28 11:57:09,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 76.13/36.02 [2019-03-28 11:57:09,973 INFO L130 ssoRankerPreferences]: Path of dumped script: 76.13/36.02 [2019-03-28 11:57:09,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 76.13/36.02 [2019-03-28 11:57:09,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 76.13/36.02 [2019-03-28 11:57:09,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 76.13/36.02 [2019-03-28 11:57:09,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:09,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 76.13/36.02 [2019-03-28 11:57:10,070 INFO L300 LassoAnalysis]: Preprocessing complete. 76.13/36.02 [2019-03-28 11:57:10,070 INFO L497 LassoAnalysis]: Using template 'affine'. 76.13/36.02 [2019-03-28 11:57:10,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:10,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.02 [2019-03-28 11:57:10,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:10,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:10,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:10,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.02 [2019-03-28 11:57:10,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:10,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:10,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 76.13/36.02 [2019-03-28 11:57:10,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 76.13/36.02 Termination analysis: LINEAR_WITH_GUESSES 76.13/36.02 Number of strict supporting invariants: 0 76.13/36.02 Number of non-strict supporting invariants: 1 76.13/36.02 Consider only non-deceasing supporting invariants: true 76.13/36.02 Simplify termination arguments: true 76.13/36.02 Simplify supporting invariants: trueOverapproximate stem: false 76.13/36.02 [2019-03-28 11:57:10,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 76.13/36.02 [2019-03-28 11:57:10,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 76.13/36.02 [2019-03-28 11:57:10,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 76.13/36.02 [2019-03-28 11:57:10,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 76.13/36.02 [2019-03-28 11:57:10,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 76.13/36.02 [2019-03-28 11:57:10,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 76.13/36.02 [2019-03-28 11:57:10,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 76.13/36.02 [2019-03-28 11:57:10,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 76.13/36.02 [2019-03-28 11:57:10,081 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 76.13/36.02 [2019-03-28 11:57:10,081 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 76.13/36.02 [2019-03-28 11:57:10,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 76.13/36.02 [2019-03-28 11:57:10,081 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 76.13/36.02 [2019-03-28 11:57:10,082 INFO L518 LassoAnalysis]: Proved termination. 76.13/36.02 [2019-03-28 11:57:10,082 INFO L520 LassoAnalysis]: Termination argument consisting of: 76.13/36.02 Ranking function f(rec_#t~pre1) = -1*rec_#t~pre1 + 1 76.13/36.02 Supporting invariants [] 76.13/36.02 [2019-03-28 11:57:10,082 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 76.13/36.02 [2019-03-28 11:57:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:10,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core 76.13/36.02 [2019-03-28 11:57:10,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.02 [2019-03-28 11:57:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:10,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core 76.13/36.02 [2019-03-28 11:57:10,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.02 [2019-03-28 11:57:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 76.13/36.02 [2019-03-28 11:57:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:10,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 76.13/36.02 [2019-03-28 11:57:10,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.02 [2019-03-28 11:57:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:10,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core 76.13/36.02 [2019-03-28 11:57:10,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 76.13/36.02 [2019-03-28 11:57:10,294 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization 76.13/36.02 [2019-03-28 11:57:10,294 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 8 loop predicates 76.13/36.02 [2019-03-28 11:57:10,295 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand 6 states. 76.13/36.02 [2019-03-28 11:57:29,448 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 36 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 126507 states and 355984 transitions. Complement of second has 56540 states. 76.13/36.02 [2019-03-28 11:57:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 13 non-accepting loop states 2 accepting loop states 76.13/36.02 [2019-03-28 11:57:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 76.13/36.02 [2019-03-28 11:57:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 140 transitions. 76.13/36.02 [2019-03-28 11:57:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 140 transitions. Stem has 5 letters. Loop has 10 letters. 76.13/36.02 [2019-03-28 11:57:29,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.02 [2019-03-28 11:57:29,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 140 transitions. Stem has 15 letters. Loop has 10 letters. 76.13/36.02 [2019-03-28 11:57:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.02 [2019-03-28 11:57:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 140 transitions. Stem has 5 letters. Loop has 20 letters. 76.13/36.02 [2019-03-28 11:57:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. 76.13/36.02 [2019-03-28 11:57:29,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126507 states and 355984 transitions. 76.13/36.02 [2019-03-28 11:57:31,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 422 76.13/36.02 [2019-03-28 11:57:32,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126507 states to 2943 states and 7163 transitions. 76.13/36.02 [2019-03-28 11:57:32,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1580 76.13/36.02 [2019-03-28 11:57:32,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1608 76.13/36.02 [2019-03-28 11:57:32,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2943 states and 7163 transitions. 76.13/36.02 [2019-03-28 11:57:32,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 76.13/36.02 [2019-03-28 11:57:32,095 INFO L706 BuchiCegarLoop]: Abstraction has 2943 states and 7163 transitions. 76.13/36.02 [2019-03-28 11:57:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states and 7163 transitions. 76.13/36.02 [2019-03-28 11:57:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1186. 76.13/36.02 [2019-03-28 11:57:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. 76.13/36.02 [2019-03-28 11:57:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2021 transitions. 76.13/36.02 [2019-03-28 11:57:32,256 INFO L729 BuchiCegarLoop]: Abstraction has 1186 states and 2021 transitions. 76.13/36.02 [2019-03-28 11:57:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 76.13/36.02 [2019-03-28 11:57:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 76.13/36.02 [2019-03-28 11:57:32,257 INFO L87 Difference]: Start difference. First operand 1186 states and 2021 transitions. Second operand 6 states. 76.13/36.02 [2019-03-28 11:57:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 76.13/36.02 [2019-03-28 11:57:32,351 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. 76.13/36.02 [2019-03-28 11:57:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 76.13/36.02 [2019-03-28 11:57:32,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 259 transitions. 76.13/36.02 [2019-03-28 11:57:32,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 76.13/36.02 [2019-03-28 11:57:32,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 151 states and 242 transitions. 76.13/36.02 [2019-03-28 11:57:32,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 76.13/36.02 [2019-03-28 11:57:32,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 76.13/36.02 [2019-03-28 11:57:32,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 242 transitions. 76.13/36.02 [2019-03-28 11:57:32,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 76.13/36.02 [2019-03-28 11:57:32,361 INFO L706 BuchiCegarLoop]: Abstraction has 151 states and 242 transitions. 76.13/36.02 [2019-03-28 11:57:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 242 transitions. 76.13/36.02 [2019-03-28 11:57:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 84. 76.13/36.02 [2019-03-28 11:57:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. 76.13/36.02 [2019-03-28 11:57:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. 76.13/36.02 [2019-03-28 11:57:32,369 INFO L729 BuchiCegarLoop]: Abstraction has 84 states and 111 transitions. 76.13/36.02 [2019-03-28 11:57:32,369 INFO L609 BuchiCegarLoop]: Abstraction has 84 states and 111 transitions. 76.13/36.02 [2019-03-28 11:57:32,369 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 76.13/36.02 [2019-03-28 11:57:32,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 111 transitions. 76.13/36.02 [2019-03-28 11:57:32,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 76.13/36.02 [2019-03-28 11:57:32,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.02 [2019-03-28 11:57:32,370 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.02 [2019-03-28 11:57:32,371 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:32,371 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:32,371 INFO L794 eck$LassoCheckResult]: Stem: 184830#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 184821#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 184841#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184815#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184822#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 184823#L15 76.13/36.02 [2019-03-28 11:57:32,372 INFO L796 eck$LassoCheckResult]: Loop: 184823#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 184862#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184861#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184858#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 184818#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 184820#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184859#L10 [46] L10-->recFINAL: Formula: (and (<= v_rec_~x_2 0) (= |v_rec_#res_1| v_rec_~x_2)) InVars {rec_~x=v_rec_~x_2} OutVars{rec_#res=|v_rec_#res_1|, rec_~x=v_rec_~x_2} AuxVars[] AssignedVars[rec_#res] 184860#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 184867#recEXIT >[48] recEXIT-->L13-1: AOR: Formula: (= |v_rec_#t~ret0_4| |v_rec_#resOutParam_1|) InVars {rec_#res=|v_rec_#resOutParam_1|} OutVars{rec_#t~ret0=|v_rec_#t~ret0_4|} AuxVars[] AssignedVars[rec_#t~ret0] LVA: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x] 184866#L13-1 [36] L13-1-->recFINAL: Formula: (= |v_rec_#res_2| |v_rec_#t~ret0_3|) InVars {rec_#t~ret0=|v_rec_#t~ret0_3|} OutVars{rec_#res=|v_rec_#res_2|, rec_#t~ret0=|v_rec_#t~ret0_2|} AuxVars[] AssignedVars[rec_#t~ret0, rec_#res] 184865#recFINAL [44] recFINAL-->recEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 184864#recEXIT >[49] recEXIT-->L15-1: AOR: Formula: (= |v_rec_#t~ret2_4| |v_rec_#resOutParam_2|) InVars {rec_#res=|v_rec_#resOutParam_2|} OutVars{rec_#t~ret2=|v_rec_#t~ret2_4|} AuxVars[] AssignedVars[rec_#t~ret2] LVA: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x] 184863#L15-1 [31] L15-1-->L16: Formula: (let ((.cse0 (+ v_rec_~x_9 (- 1)))) (and (= v_rec_~store~0_1 |v_rec_#t~ret2_3|) (= |v_rec_#t~pre3_1| .cse0) (= v_rec_~x_8 .cse0))) InVars {rec_#t~ret2=|v_rec_#t~ret2_3|, rec_~x=v_rec_~x_9} OutVars{rec_~x=v_rec_~x_8, rec_~store~0=v_rec_~store~0_1, rec_#t~pre3=|v_rec_#t~pre3_1|, rec_#t~ret2=|v_rec_#t~ret2_2|, rec_#t~pre1=|v_rec_#t~pre1_3|} AuxVars[] AssignedVars[rec_~x, rec_~store~0, rec_#t~pre3, rec_#t~ret2, rec_#t~pre1] 184819#L16 [37] L16-->recENTRY: Formula: (= |v_rec_#in~xInParam_3| |v_rec_#t~pre3_4|) InVars {rec_#t~pre3=|v_rec_#t~pre3_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_3|} AuxVars[] AssignedVars[rec_#in~x]< 184820#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184859#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184857#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 184823#L15 76.13/36.02 [2019-03-28 11:57:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash 67806948, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:32,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:32,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1019409301, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:32,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 76.13/36.02 [2019-03-28 11:57:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 76.13/36.02 [2019-03-28 11:57:32,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 76.13/36.02 [2019-03-28 11:57:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 76.13/36.02 [2019-03-28 11:57:32,419 INFO L811 eck$LassoCheckResult]: loop already infeasible 76.13/36.02 [2019-03-28 11:57:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 76.13/36.02 [2019-03-28 11:57:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 76.13/36.02 [2019-03-28 11:57:32,419 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. cyclomatic complexity: 30 Second operand 6 states. 76.13/36.02 [2019-03-28 11:57:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 76.13/36.02 [2019-03-28 11:57:32,462 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. 76.13/36.02 [2019-03-28 11:57:32,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 76.13/36.02 [2019-03-28 11:57:32,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. 76.13/36.02 [2019-03-28 11:57:32,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 76.13/36.02 [2019-03-28 11:57:32,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 39 transitions. 76.13/36.02 [2019-03-28 11:57:32,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 76.13/36.02 [2019-03-28 11:57:32,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 76.13/36.02 [2019-03-28 11:57:32,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. 76.13/36.02 [2019-03-28 11:57:32,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 76.13/36.02 [2019-03-28 11:57:32,466 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. 76.13/36.02 [2019-03-28 11:57:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. 76.13/36.02 [2019-03-28 11:57:32,467 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 76.13/36.02 [2019-03-28 11:57:32,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. 76.13/36.02 [2019-03-28 11:57:32,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 76.13/36.02 [2019-03-28 11:57:32,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 76.13/36.02 [2019-03-28 11:57:32,468 INFO L119 BuchiIsEmpty]: Starting construction of run 76.13/36.02 [2019-03-28 11:57:32,468 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:32,468 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] 76.13/36.02 [2019-03-28 11:57:32,469 INFO L794 eck$LassoCheckResult]: Stem: 184949#ULTIMATE.startENTRY [41] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 184950#L23 [43] L23-->recENTRY: Formula: (= |v_rec_#in~xInParam_4| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec_#in~x=|v_rec_#in~xInParam_4|} AuxVars[] AssignedVars[rec_#in~x]< 184955#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184948#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184956#L12 [60] L12-->L15: Formula: (let ((.cse0 (mod v_rec_~x_7 2)) (.cse1 (+ v_rec_~x_7 1))) (and (> 0 (+ .cse0 (- 2))) (= v_rec_~x_6 .cse1) (< 0 .cse0) (= |v_rec_#t~pre1_1| .cse1))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 184943#L15 76.13/36.02 [2019-03-28 11:57:32,469 INFO L796 eck$LassoCheckResult]: Loop: 184943#L15 [38] L15-->recENTRY: Formula: (= |v_rec_#in~xInParam_2| |v_rec_#t~pre1_4|) InVars {rec_#t~pre1=|v_rec_#t~pre1_4|} OutVars{rec_#in~x=|v_rec_#in~xInParam_2|} AuxVars[] AssignedVars[rec_#in~x]< 184942#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184944#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184953#L12 [57] L12-->L13: Formula: (= (mod v_rec_~x_4 2) 0) InVars {rec_~x=v_rec_~x_4} OutVars{rec_~x=v_rec_~x_4} AuxVars[] AssignedVars[] 184951#L13 [33] L13-->recENTRY: Formula: (= |v_rec_#in~xInParam_1| (let ((.cse0 (div v_rec_~x_10 2))) (ite (and (not (= 0 (mod v_rec_~x_10 2))) (< v_rec_~x_10 0)) (+ .cse0 1) .cse0))) InVars {rec_~x=v_rec_~x_10} OutVars{rec_#in~x=|v_rec_#in~xInParam_1|} AuxVars[] AssignedVars[rec_#in~x]< 184952#recENTRY [32] recENTRY-->L10: Formula: (= v_rec_~x_1 |v_rec_#in~x_1|) InVars {rec_#in~x=|v_rec_#in~x_1|} OutVars{rec_~x=v_rec_~x_1, rec_#in~x=|v_rec_#in~x_1|} AuxVars[] AssignedVars[rec_~x] 184958#L10 [52] L10-->L12: Formula: (> v_rec_~x_3 0) InVars {rec_~x=v_rec_~x_3} OutVars{rec_~x=v_rec_~x_3} AuxVars[] AssignedVars[] 184957#L12 [59] L12-->L15: Formula: (let ((.cse0 (+ v_rec_~x_7 1))) (and (= v_rec_~x_6 .cse0) (< 0 (mod v_rec_~x_7 2)) (= |v_rec_#t~pre1_1| .cse0) (>= v_rec_~x_7 0))) InVars {rec_~x=v_rec_~x_7} OutVars{rec_~x=v_rec_~x_6, rec_#t~pre1=|v_rec_#t~pre1_1|} AuxVars[] AssignedVars[rec_~x, rec_#t~pre1] 184943#L15 76.13/36.02 [2019-03-28 11:57:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 67806949, now seen corresponding path program 3 times 76.13/36.02 [2019-03-28 11:57:32,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:32,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -127452378, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:32,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 76.13/36.02 [2019-03-28 11:57:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1084310006, now seen corresponding path program 1 times 76.13/36.02 [2019-03-28 11:57:32,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 76.13/36.02 [2019-03-28 11:57:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 76.13/36.02 [2019-03-28 11:57:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 76.13/36.02 [2019-03-28 11:57:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 76.13/36.02 [2019-03-28 11:57:32,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:57:32 BasicIcfg 76.13/36.02 [2019-03-28 11:57:32,843 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 76.13/36.02 [2019-03-28 11:57:32,844 INFO L168 Benchmark]: Toolchain (without parser) took 31685.77 ms. Allocated memory was 649.6 MB in the beginning and 4.5 GB in the end (delta: 3.8 GB). Free memory was 563.5 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,846 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.15 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 562.4 MB in the beginning and 639.8 MB in the end (delta: -77.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.82 ms. Allocated memory is still 673.2 MB. Free memory was 639.8 MB in the beginning and 638.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,847 INFO L168 Benchmark]: Boogie Preprocessor took 16.93 ms. Allocated memory is still 673.2 MB. Free memory was 638.8 MB in the beginning and 637.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,848 INFO L168 Benchmark]: RCFGBuilder took 209.34 ms. Allocated memory is still 673.2 MB. Free memory was 637.7 MB in the beginning and 621.4 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,848 INFO L168 Benchmark]: BlockEncodingV2 took 88.88 ms. Allocated memory is still 673.2 MB. Free memory was 621.4 MB in the beginning and 614.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,849 INFO L168 Benchmark]: TraceAbstraction took 169.22 ms. Allocated memory is still 673.2 MB. Free memory was 614.9 MB in the beginning and 604.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,849 INFO L168 Benchmark]: BuchiAutomizer took 30884.42 ms. Allocated memory was 673.2 MB in the beginning and 4.5 GB in the end (delta: 3.8 GB). Free memory was 603.1 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 50.3 GB. 76.13/36.02 [2019-03-28 11:57:32,854 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 76.13/36.02 --- Results --- 76.13/36.02 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 76.13/36.02 - StatisticsResult: Initial Icfg 76.13/36.02 17 locations, 21 edges 76.13/36.02 - StatisticsResult: Encoded RCFG 76.13/36.02 13 locations, 34 edges 76.13/36.02 * Results from de.uni_freiburg.informatik.ultimate.core: 76.13/36.02 - StatisticsResult: Toolchain Benchmarks 76.13/36.02 Benchmark results are: 76.13/36.02 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 76.13/36.02 * CACSL2BoogieTranslator took 278.15 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 562.4 MB in the beginning and 639.8 MB in the end (delta: -77.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 76.13/36.02 * Boogie Procedure Inliner took 33.82 ms. Allocated memory is still 673.2 MB. Free memory was 639.8 MB in the beginning and 638.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 76.13/36.02 * Boogie Preprocessor took 16.93 ms. Allocated memory is still 673.2 MB. Free memory was 638.8 MB in the beginning and 637.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 76.13/36.02 * RCFGBuilder took 209.34 ms. Allocated memory is still 673.2 MB. Free memory was 637.7 MB in the beginning and 621.4 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 76.13/36.02 * BlockEncodingV2 took 88.88 ms. Allocated memory is still 673.2 MB. Free memory was 621.4 MB in the beginning and 614.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 76.13/36.02 * TraceAbstraction took 169.22 ms. Allocated memory is still 673.2 MB. Free memory was 614.9 MB in the beginning and 604.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 76.13/36.02 * BuchiAutomizer took 30884.42 ms. Allocated memory was 673.2 MB in the beginning and 4.5 GB in the end (delta: 3.8 GB). Free memory was 603.1 MB in the beginning and 1.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 50.3 GB. 76.13/36.02 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 76.13/36.02 - AllSpecificationsHoldResult: All specifications hold 76.13/36.02 We were not able to verify any specifiation because the program does not contain any specification. 76.13/36.02 - StatisticsResult: Ultimate Automizer benchmark data 76.13/36.02 CFG has 2 procedures, 13 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=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 17 PreInvPairs, 17 NumberOfFragments, 5 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 76.13/36.02 - StatisticsResult: Constructed decomposition of program 76.13/36.02 Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(x) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * aux-++x-aux + 1 and consists of 17 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 17 locations. 76.13/36.02 - StatisticsResult: Timing statistics 76.13/36.02 BüchiAutomizer plugin needed 30.8s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 7.9s. Construction of modules took 0.4s. Büchi inclusion checks took 19.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1850 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 2.6s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 105 SDtfs, 109 SDslu, 174 SDs, 0 SdLazy, 367 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div369 bol100 ite100 ukn100 eq143 hnf52 smp85 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 31ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.4s 76.13/36.02 - TerminationAnalysisResult: Nontermination possible 76.13/36.02 Buchi Automizer proved that your program is nonterminating for some inputs 76.13/36.02 - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. 76.13/36.02 Nontermination argument in form of an infinite execution 76.13/36.02 State at position 0 is 76.13/36.02 {} 76.13/36.02 State at position 1 is 76.13/36.02 {x=2, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@2fdbcb20=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56e079b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@609061b=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a95f4e3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fd7af4f=0, store=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f0d15ea=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31e744c=0, x=0, y=0} 76.13/36.02 - StatisticsResult: NonterminationArgumentStatistics 76.13/36.02 Fixpoint 76.13/36.02 - NonterminatingLassoResult [Line: 15]: Nonterminating execution 76.13/36.02 Found a nonterminating execution for the following lasso shaped sequence of statements. 76.13/36.02 Stem: 76.13/36.02 [L21] int x = __VERIFIER_nondet_int(); 76.13/36.02 [L22] int y; 76.13/36.02 [L23] CALL rec(x) 76.13/36.02 [L10] COND FALSE !(x <= 0) 76.13/36.02 [L12] COND FALSE !(x%2 == 0) 76.13/36.02 [L15] ++x 76.13/36.02 Loop: 76.13/36.02 [L15] CALL rec(++x) 76.13/36.02 [L10] COND FALSE !(x <= 0) 76.13/36.02 [L12] COND TRUE x%2 == 0 76.13/36.02 [L13] CALL rec(x/2) 76.13/36.02 [L10] COND FALSE !(x <= 0) 76.13/36.02 [L12] COND FALSE !(x%2 == 0) 76.13/36.02 [L15] ++x 76.13/36.02 End of lasso representation. 76.13/36.02 RESULT: Ultimate proved your program to be incorrect! 76.13/36.02 !SESSION 2019-03-28 11:56:57.906 ----------------------------------------------- 76.13/36.02 eclipse.buildId=unknown 76.13/36.02 java.version=1.8.0_181 76.13/36.02 java.vendor=Oracle Corporation 76.13/36.02 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 76.13/36.02 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 76.13/36.02 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 76.13/36.02 76.13/36.02 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:57:33.089 76.13/36.02 !MESSAGE The workspace will exit with unsaved changes in this session. 76.13/36.02 Received shutdown request... 76.13/36.02 Ultimate: 76.13/36.02 GTK+ Version Check 76.13/36.02 EOF