25.08/11.91 YES 25.08/11.91 25.08/11.91 Ultimate: Cannot open display: 25.08/11.91 This is Ultimate 0.1.24-8dc7c08-m 25.08/11.91 [2019-03-28 12:18:01,303 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.08/11.91 [2019-03-28 12:18:01,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.08/11.91 [2019-03-28 12:18:01,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.08/11.91 [2019-03-28 12:18:01,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.08/11.91 [2019-03-28 12:18:01,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.08/11.91 [2019-03-28 12:18:01,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.08/11.91 [2019-03-28 12:18:01,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.08/11.91 [2019-03-28 12:18:01,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.08/11.91 [2019-03-28 12:18:01,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.08/11.91 [2019-03-28 12:18:01,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.08/11.91 [2019-03-28 12:18:01,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.08/11.91 [2019-03-28 12:18:01,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.08/11.91 [2019-03-28 12:18:01,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.08/11.91 [2019-03-28 12:18:01,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.08/11.91 [2019-03-28 12:18:01,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.08/11.91 [2019-03-28 12:18:01,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.08/11.91 [2019-03-28 12:18:01,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.08/11.91 [2019-03-28 12:18:01,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.08/11.91 [2019-03-28 12:18:01,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.08/11.91 [2019-03-28 12:18:01,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.08/11.91 [2019-03-28 12:18:01,339 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.08/11.91 [2019-03-28 12:18:01,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.08/11.91 [2019-03-28 12:18:01,340 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.08/11.91 [2019-03-28 12:18:01,341 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.08/11.91 [2019-03-28 12:18:01,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.08/11.91 [2019-03-28 12:18:01,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.08/11.91 [2019-03-28 12:18:01,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.08/11.91 [2019-03-28 12:18:01,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.08/11.91 [2019-03-28 12:18:01,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.08/11.91 [2019-03-28 12:18:01,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.08/11.91 [2019-03-28 12:18:01,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.08/11.91 [2019-03-28 12:18:01,347 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 25.08/11.91 [2019-03-28 12:18:01,361 INFO L110 SettingsManager]: Loading preferences was successful 25.08/11.91 [2019-03-28 12:18:01,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.08/11.91 [2019-03-28 12:18:01,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.08/11.91 [2019-03-28 12:18:01,363 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.08/11.91 [2019-03-28 12:18:01,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.08/11.91 [2019-03-28 12:18:01,363 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.08/11.91 [2019-03-28 12:18:01,364 INFO L133 SettingsManager]: * Use SBE=true 25.08/11.91 [2019-03-28 12:18:01,364 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.08/11.91 [2019-03-28 12:18:01,364 INFO L133 SettingsManager]: * Use old map elimination=false 25.08/11.91 [2019-03-28 12:18:01,364 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.08/11.91 [2019-03-28 12:18:01,364 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.08/11.91 [2019-03-28 12:18:01,365 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.08/11.91 [2019-03-28 12:18:01,365 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.08/11.91 [2019-03-28 12:18:01,365 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.08/11.91 [2019-03-28 12:18:01,365 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:01,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.08/11.91 [2019-03-28 12:18:01,366 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.08/11.91 [2019-03-28 12:18:01,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.08/11.91 [2019-03-28 12:18:01,366 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.08/11.91 [2019-03-28 12:18:01,366 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.08/11.91 [2019-03-28 12:18:01,366 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.08/11.91 [2019-03-28 12:18:01,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.08/11.91 [2019-03-28 12:18:01,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.08/11.91 [2019-03-28 12:18:01,367 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.08/11.91 [2019-03-28 12:18:01,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.08/11.91 [2019-03-28 12:18:01,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.08/11.91 [2019-03-28 12:18:01,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.08/11.91 [2019-03-28 12:18:01,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.08/11.91 [2019-03-28 12:18:01,368 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.08/11.91 [2019-03-28 12:18:01,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.08/11.91 [2019-03-28 12:18:01,406 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.08/11.91 [2019-03-28 12:18:01,410 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.08/11.91 [2019-03-28 12:18:01,411 INFO L271 PluginConnector]: Initializing CDTParser... 25.08/11.91 [2019-03-28 12:18:01,412 INFO L276 PluginConnector]: CDTParser initialized 25.08/11.91 [2019-03-28 12:18:01,412 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 25.08/11.91 [2019-03-28 12:18:01,505 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/fc849a86f84147319797e91af6c83583/FLAG0db9c062c 25.08/11.91 [2019-03-28 12:18:01,847 INFO L307 CDTParser]: Found 1 translation units. 25.08/11.91 [2019-03-28 12:18:01,847 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 25.08/11.91 [2019-03-28 12:18:01,854 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/fc849a86f84147319797e91af6c83583/FLAG0db9c062c 25.08/11.91 [2019-03-28 12:18:02,261 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/fc849a86f84147319797e91af6c83583 25.08/11.91 [2019-03-28 12:18:02,272 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.08/11.91 [2019-03-28 12:18:02,274 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.08/11.91 [2019-03-28 12:18:02,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.08/11.91 [2019-03-28 12:18:02,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.08/11.91 [2019-03-28 12:18:02,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.08/11.91 [2019-03-28 12:18:02,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe42143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:02,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.08/11.91 [2019-03-28 12:18:02,309 INFO L176 MainTranslator]: Built tables and reachable declarations 25.08/11.91 [2019-03-28 12:18:02,473 INFO L206 PostProcessor]: Analyzing one entry point: main 25.08/11.91 [2019-03-28 12:18:02,477 INFO L191 MainTranslator]: Completed pre-run 25.08/11.91 [2019-03-28 12:18:02,495 INFO L206 PostProcessor]: Analyzing one entry point: main 25.08/11.91 [2019-03-28 12:18:02,572 INFO L195 MainTranslator]: Completed translation 25.08/11.91 [2019-03-28 12:18:02,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02 WrapperNode 25.08/11.91 [2019-03-28 12:18:02,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.08/11.91 [2019-03-28 12:18:02,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.08/11.91 [2019-03-28 12:18:02,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.08/11.91 [2019-03-28 12:18:02,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.08/11.91 [2019-03-28 12:18:02,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.08/11.91 [2019-03-28 12:18:02,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.08/11.91 [2019-03-28 12:18:02,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.08/11.91 [2019-03-28 12:18:02,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.08/11.91 [2019-03-28 12:18:02,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.08/11.91 [2019-03-28 12:18:02,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.08/11.91 [2019-03-28 12:18:02,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.08/11.91 [2019-03-28 12:18:02,637 INFO L276 PluginConnector]: RCFGBuilder initialized 25.08/11.91 [2019-03-28 12:18:02,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (1/1) ... 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.08/11.91 [2019-03-28 12:18:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure average 25.08/11.91 [2019-03-28 12:18:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure average 25.08/11.91 [2019-03-28 12:18:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.08/11.91 [2019-03-28 12:18:02,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.08/11.91 [2019-03-28 12:18:02,878 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.08/11.91 [2019-03-28 12:18:02,879 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 25.08/11.91 [2019-03-28 12:18:02,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:18:02 BoogieIcfgContainer 25.08/11.91 [2019-03-28 12:18:02,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.08/11.91 [2019-03-28 12:18:02,881 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.08/11.91 [2019-03-28 12:18:02,881 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.08/11.91 [2019-03-28 12:18:02,884 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.08/11.91 [2019-03-28 12:18:02,885 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:18:02" (1/1) ... 25.08/11.91 [2019-03-28 12:18:02,904 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 24 edges 25.08/11.91 [2019-03-28 12:18:02,906 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.08/11.91 [2019-03-28 12:18:02,907 INFO L263 BlockEncoder]: Using Maximize final states 25.08/11.91 [2019-03-28 12:18:02,908 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.08/11.91 [2019-03-28 12:18:02,908 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.08/11.91 [2019-03-28 12:18:02,911 INFO L296 BlockEncoder]: Using Remove sink states 25.08/11.91 [2019-03-28 12:18:02,912 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.08/11.91 [2019-03-28 12:18:02,913 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.08/11.91 [2019-03-28 12:18:02,930 INFO L185 BlockEncoder]: Using Use SBE 25.08/11.91 [2019-03-28 12:18:02,939 INFO L200 BlockEncoder]: SBE split 0 edges 25.08/11.91 [2019-03-28 12:18:02,944 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.08/11.91 [2019-03-28 12:18:02,946 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.08/11.91 [2019-03-28 12:18:02,956 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 25.08/11.91 [2019-03-28 12:18:02,959 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 25.08/11.91 [2019-03-28 12:18:02,960 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.08/11.91 [2019-03-28 12:18:02,961 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.08/11.91 [2019-03-28 12:18:02,961 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.08/11.91 [2019-03-28 12:18:02,962 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.08/11.91 [2019-03-28 12:18:02,962 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 20 edges 25.08/11.91 [2019-03-28 12:18:02,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:18:02 BasicIcfg 25.08/11.91 [2019-03-28 12:18:02,963 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.08/11.91 [2019-03-28 12:18:02,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.08/11.91 [2019-03-28 12:18:02,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.08/11.91 [2019-03-28 12:18:02,967 INFO L276 PluginConnector]: TraceAbstraction initialized 25.08/11.91 [2019-03-28 12:18:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:18:02" (1/4) ... 25.08/11.91 [2019-03-28 12:18:02,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f231b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:18:02, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:02,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (2/4) ... 25.08/11.91 [2019-03-28 12:18:02,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f231b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:18:02, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:02,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:18:02" (3/4) ... 25.08/11.91 [2019-03-28 12:18:02,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f231b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:18:02, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:02,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:18:02" (4/4) ... 25.08/11.91 [2019-03-28 12:18:02,971 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.08/11.91 [2019-03-28 12:18:02,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.08/11.91 [2019-03-28 12:18:02,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 25.08/11.91 [2019-03-28 12:18:03,009 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 25.08/11.91 [2019-03-28 12:18:03,038 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.08/11.91 [2019-03-28 12:18:03,039 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.08/11.91 [2019-03-28 12:18:03,039 INFO L383 AbstractCegarLoop]: Hoare is true 25.08/11.91 [2019-03-28 12:18:03,039 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.08/11.91 [2019-03-28 12:18:03,039 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.08/11.91 [2019-03-28 12:18:03,039 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.08/11.91 [2019-03-28 12:18:03,040 INFO L387 AbstractCegarLoop]: Difference is false 25.08/11.91 [2019-03-28 12:18:03,040 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.08/11.91 [2019-03-28 12:18:03,040 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.08/11.91 [2019-03-28 12:18:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. 25.08/11.91 [2019-03-28 12:18:03,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.08/11.91 [2019-03-28 12:18:03,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. 25.08/11.91 [2019-03-28 12:18:03,135 INFO L448 ceAbstractionStarter]: For program point averageFINAL(lines 42 50) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,136 INFO L451 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,136 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 49) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,136 INFO L448 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,136 INFO L451 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,136 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 49) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,136 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,137 INFO L451 ceAbstractionStarter]: At program point averageENTRY(lines 42 50) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,137 INFO L448 ceAbstractionStarter]: For program point averageEXIT(lines 42 50) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,137 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 37) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,137 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,137 INFO L451 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,138 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,138 INFO L451 ceAbstractionStarter]: At program point L37-1(lines 32 38) the Hoare annotation is: true 25.08/11.91 [2019-03-28 12:18:03,138 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. 25.08/11.91 [2019-03-28 12:18:03,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:18:03 BasicIcfg 25.08/11.91 [2019-03-28 12:18:03,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.08/11.91 [2019-03-28 12:18:03,148 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.08/11.91 [2019-03-28 12:18:03,148 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.08/11.91 [2019-03-28 12:18:03,151 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.08/11.91 [2019-03-28 12:18:03,152 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.08/11.91 [2019-03-28 12:18:03,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:18:02" (1/5) ... 25.08/11.91 [2019-03-28 12:18:03,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2c21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:18:03, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:03,153 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.08/11.91 [2019-03-28 12:18:03,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:18:02" (2/5) ... 25.08/11.91 [2019-03-28 12:18:03,153 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2c21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:18:03, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:03,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.08/11.91 [2019-03-28 12:18:03,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:18:02" (3/5) ... 25.08/11.91 [2019-03-28 12:18:03,154 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2c21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:18:03, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:03,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.08/11.91 [2019-03-28 12:18:03,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:18:02" (4/5) ... 25.08/11.91 [2019-03-28 12:18:03,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e2c21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:18:03, skipping insertion in model container 25.08/11.91 [2019-03-28 12:18:03,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.08/11.91 [2019-03-28 12:18:03,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:18:03" (5/5) ... 25.08/11.91 [2019-03-28 12:18:03,157 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.08/11.91 [2019-03-28 12:18:03,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.08/11.91 [2019-03-28 12:18:03,184 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.08/11.91 [2019-03-28 12:18:03,184 INFO L375 BuchiCegarLoop]: Hoare is true 25.08/11.91 [2019-03-28 12:18:03,185 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.08/11.91 [2019-03-28 12:18:03,185 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.08/11.91 [2019-03-28 12:18:03,185 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.08/11.91 [2019-03-28 12:18:03,185 INFO L379 BuchiCegarLoop]: Difference is false 25.08/11.91 [2019-03-28 12:18:03,185 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.08/11.91 [2019-03-28 12:18:03,185 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.08/11.91 [2019-03-28 12:18:03,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 25.08/11.91 [2019-03-28 12:18:03,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.08/11.91 [2019-03-28 12:18:03,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.08/11.91 [2019-03-28 12:18:03,211 INFO L119 BuchiIsEmpty]: Starting construction of run 25.08/11.91 [2019-03-28 12:18:03,219 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:03,219 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.08/11.91 [2019-03-28 12:18:03,220 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.08/11.91 [2019-03-28 12:18:03,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 25.08/11.91 [2019-03-28 12:18:03,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.08/11.91 [2019-03-28 12:18:03,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.08/11.91 [2019-03-28 12:18:03,222 INFO L119 BuchiIsEmpty]: Starting construction of run 25.08/11.91 [2019-03-28 12:18:03,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:03,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 25.08/11.91 [2019-03-28 12:18:03,228 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 12#L34true [52] L34-->L37: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 4#L37true [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 10#L34-1true [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 17#L37-1true [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 7#L28true [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 9#averageENTRYtrue 25.08/11.91 [2019-03-28 12:18:03,228 INFO L796 eck$LassoCheckResult]: Loop: 9#averageENTRYtrue [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 5#L43true [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 3#L44true [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 9#averageENTRYtrue 25.08/11.91 [2019-03-28 12:18:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1955295538, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:03,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash 77293, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:03,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:03,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1862856704, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:03,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:03,443 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:03,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:03,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:03,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:03,445 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.08/11.91 [2019-03-28 12:18:03,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:03,445 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:03,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.08/11.91 [2019-03-28 12:18:03,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:03,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:03,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,561 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:03,562 INFO L412 LassoAnalysis]: Checking for nontermination... 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:03,569 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:03,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.08/11.91 [2019-03-28 12:18:03,579 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret7=0} Honda state: {average_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:03,610 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:03,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.08/11.91 [2019-03-28 12:18:03,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#res=0} Honda state: {average_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:03,644 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:03,647 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.08/11.91 [2019-03-28 12:18:03,648 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret8=0} Honda state: {average_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:03,678 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:03,710 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:03,743 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.08/11.91 [2019-03-28 12:18:03,746 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:03,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:03,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:03,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:03,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.08/11.91 [2019-03-28 12:18:03,747 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:03,747 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:03,747 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:03,747 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 25.08/11.91 [2019-03-28 12:18:03,747 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:03,747 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:03,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:03,824 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:03,830 INFO L497 LassoAnalysis]: Using template 'affine'. 25.08/11.91 [2019-03-28 12:18:03,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:03,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:03,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:03,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:03,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:03,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:03,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:03,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:03,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:03,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:03,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:03,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:03,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:03,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:03,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:03,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:03,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:03,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:03,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:03,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:03,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:03,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:03,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:03,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:03,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:03,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:03,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:03,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:03,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:03,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:03,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:03,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:03,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:03,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:03,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:03,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:03,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:03,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:03,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:03,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:03,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:03,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:03,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:03,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:03,861 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.08/11.91 [2019-03-28 12:18:03,865 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.08/11.91 [2019-03-28 12:18:03,865 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 25.08/11.91 [2019-03-28 12:18:03,867 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.08/11.91 [2019-03-28 12:18:03,867 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.08/11.91 [2019-03-28 12:18:03,867 INFO L518 LassoAnalysis]: Proved termination. 25.08/11.91 [2019-03-28 12:18:03,868 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.08/11.91 Ranking function f(average_#in~x) = 1*average_#in~x 25.08/11.91 Supporting invariants [] 25.08/11.91 [2019-03-28 12:18:03,869 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.08/11.91 [2019-03-28 12:18:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:03,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:03,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:03,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:03,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:03,989 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 25.08/11.91 [2019-03-28 12:18:03,994 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 25.08/11.91 [2019-03-28 12:18:03,996 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 4 states. 25.08/11.91 [2019-03-28 12:18:04,085 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 16 states. 25.08/11.91 [2019-03-28 12:18:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.08/11.91 [2019-03-28 12:18:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.08/11.91 [2019-03-28 12:18:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. 25.08/11.91 [2019-03-28 12:18:04,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. 25.08/11.91 [2019-03-28 12:18:04,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:04,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. 25.08/11.91 [2019-03-28 12:18:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:04,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 6 letters. 25.08/11.91 [2019-03-28 12:18:04,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:04,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. 25.08/11.91 [2019-03-28 12:18:04,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.08/11.91 [2019-03-28 12:18:04,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 23 states and 28 transitions. 25.08/11.91 [2019-03-28 12:18:04,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 25.08/11.91 [2019-03-28 12:18:04,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 25.08/11.91 [2019-03-28 12:18:04,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. 25.08/11.91 [2019-03-28 12:18:04,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.08/11.91 [2019-03-28 12:18:04,118 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. 25.08/11.91 [2019-03-28 12:18:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. 25.08/11.91 [2019-03-28 12:18:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. 25.08/11.91 [2019-03-28 12:18:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 25.08/11.91 [2019-03-28 12:18:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. 25.08/11.91 [2019-03-28 12:18:04,151 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 25.08/11.91 [2019-03-28 12:18:04,152 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. 25.08/11.91 [2019-03-28 12:18:04,152 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.08/11.91 [2019-03-28 12:18:04,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. 25.08/11.91 [2019-03-28 12:18:04,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.08/11.91 [2019-03-28 12:18:04,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.08/11.91 [2019-03-28 12:18:04,153 INFO L119 BuchiIsEmpty]: Starting construction of run 25.08/11.91 [2019-03-28 12:18:04,153 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:04,154 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:04,154 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 149#L34 [52] L34-->L37: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 142#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 143#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 150#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 140#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 144#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 146#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 147#L45 25.08/11.91 [2019-03-28 12:18:04,155 INFO L796 eck$LassoCheckResult]: Loop: 147#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 137#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 138#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 151#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 147#L45 25.08/11.91 [2019-03-28 12:18:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2138302111, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:04,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.08/11.91 [2019-03-28 12:18:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 25.08/11.91 [2019-03-28 12:18:04,232 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.08/11.91 [2019-03-28 12:18:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2704848, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:04,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:04,333 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:04,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:04,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:04,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:04,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.08/11.91 [2019-03-28 12:18:04,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:04,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:04,334 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:04,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 25.08/11.91 [2019-03-28 12:18:04,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:04,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:04,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:04,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:04,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:04,422 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:04,422 INFO L412 LassoAnalysis]: Checking for nontermination... 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:04,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:04,432 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:04,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.08/11.91 [2019-03-28 12:18:04,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret8=0} Honda state: {average_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:04,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:04,468 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:04,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:04,505 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:05,096 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.08/11.91 [2019-03-28 12:18:05,099 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:05,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:05,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:05,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:05,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.08/11.91 [2019-03-28 12:18:05,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:05,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:05,100 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:05,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 25.08/11.91 [2019-03-28 12:18:05,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:05,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:05,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,181 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:05,181 INFO L497 LassoAnalysis]: Using template 'affine'. 25.08/11.91 [2019-03-28 12:18:05,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:05,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:05,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:05,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:05,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:05,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:05,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:05,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:05,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:05,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:05,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:05,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:05,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:05,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:05,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:05,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:05,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:05,195 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.08/11.91 [2019-03-28 12:18:05,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.08/11.91 [2019-03-28 12:18:05,200 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.08/11.91 [2019-03-28 12:18:05,200 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.08/11.91 [2019-03-28 12:18:05,200 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.08/11.91 [2019-03-28 12:18:05,200 INFO L518 LassoAnalysis]: Proved termination. 25.08/11.91 [2019-03-28 12:18:05,201 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.08/11.91 Ranking function f(average_~y) = 1*average_~y 25.08/11.91 Supporting invariants [] 25.08/11.91 [2019-03-28 12:18:05,201 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.08/11.91 [2019-03-28 12:18:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:05,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:05,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:05,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:05,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,375 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.08/11.91 [2019-03-28 12:18:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:05,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:05,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:05,402 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 25.08/11.91 [2019-03-28 12:18:05,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 25.08/11.91 [2019-03-28 12:18:05,403 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. 25.08/11.91 [2019-03-28 12:18:05,444 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 48 states and 63 transitions. Complement of second has 36 states. 25.08/11.91 [2019-03-28 12:18:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 25.08/11.91 [2019-03-28 12:18:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.08/11.91 [2019-03-28 12:18:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. 25.08/11.91 [2019-03-28 12:18:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. 25.08/11.91 [2019-03-28 12:18:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 4 letters. 25.08/11.91 [2019-03-28 12:18:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:05,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. 25.08/11.91 [2019-03-28 12:18:05,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:05,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. 25.08/11.91 [2019-03-28 12:18:05,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 25.08/11.91 [2019-03-28 12:18:05,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 26 states and 33 transitions. 25.08/11.91 [2019-03-28 12:18:05,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 25.08/11.91 [2019-03-28 12:18:05,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 25.08/11.91 [2019-03-28 12:18:05,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. 25.08/11.91 [2019-03-28 12:18:05,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.08/11.91 [2019-03-28 12:18:05,456 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. 25.08/11.91 [2019-03-28 12:18:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. 25.08/11.91 [2019-03-28 12:18:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. 25.08/11.91 [2019-03-28 12:18:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 25.08/11.91 [2019-03-28 12:18:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. 25.08/11.91 [2019-03-28 12:18:05,459 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 25.08/11.91 [2019-03-28 12:18:05,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 25.08/11.91 [2019-03-28 12:18:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 25.08/11.91 [2019-03-28 12:18:05,463 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 6 states. 25.08/11.91 [2019-03-28 12:18:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.08/11.91 [2019-03-28 12:18:05,532 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:05,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 25.08/11.91 [2019-03-28 12:18:05,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:05,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.08/11.91 [2019-03-28 12:18:05,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 37 transitions. 25.08/11.91 [2019-03-28 12:18:05,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 25.08/11.91 [2019-03-28 12:18:05,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 25.08/11.91 [2019-03-28 12:18:05,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. 25.08/11.91 [2019-03-28 12:18:05,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.08/11.91 [2019-03-28 12:18:05,539 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. 25.08/11.91 [2019-03-28 12:18:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. 25.08/11.91 [2019-03-28 12:18:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. 25.08/11.91 [2019-03-28 12:18:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.08/11.91 [2019-03-28 12:18:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. 25.08/11.91 [2019-03-28 12:18:05,541 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. 25.08/11.91 [2019-03-28 12:18:05,541 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. 25.08/11.91 [2019-03-28 12:18:05,542 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.08/11.91 [2019-03-28 12:18:05,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. 25.08/11.91 [2019-03-28 12:18:05,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.08/11.91 [2019-03-28 12:18:05,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.08/11.91 [2019-03-28 12:18:05,543 INFO L119 BuchiIsEmpty]: Starting construction of run 25.08/11.91 [2019-03-28 12:18:05,543 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:05,543 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:05,544 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 371#L34 [65] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_2 0) (= |v_ULTIMATE.start_random_#res_2| v_ULTIMATE.start_random_~x~1_2)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_2|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 368#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 369#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 384#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 367#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 383#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 374#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 375#L45 25.08/11.91 [2019-03-28 12:18:05,544 INFO L796 eck$LassoCheckResult]: Loop: 375#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 362#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 379#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 381#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 361#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 363#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 382#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 375#L45 25.08/11.91 [2019-03-28 12:18:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 809311150, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:05,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:05,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:05,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1024925884, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:05,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:05,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 921876215, now seen corresponding path program 1 times 25.08/11.91 [2019-03-28 12:18:05,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:05,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:05,737 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:05,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:05,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:05,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:05,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.08/11.91 [2019-03-28 12:18:05,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:05,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:05,756 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:05,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 25.08/11.91 [2019-03-28 12:18:05,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:05,756 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:05,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:05,822 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:05,823 INFO L412 LassoAnalysis]: Checking for nontermination... 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:05,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:05,826 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:05,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:05,859 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:06,800 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.08/11.91 [2019-03-28 12:18:06,803 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:06,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:06,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:06,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:06,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.08/11.91 [2019-03-28 12:18:06,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:06,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:06,804 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:06,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 25.08/11.91 [2019-03-28 12:18:06,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:06,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:06,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:06,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:06,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:06,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:06,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:06,870 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:06,871 INFO L497 LassoAnalysis]: Using template 'affine'. 25.08/11.91 [2019-03-28 12:18:06,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:06,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:06,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:06,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:06,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:06,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:06,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:06,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:06,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.08/11.91 [2019-03-28 12:18:06,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.08/11.91 [2019-03-28 12:18:06,882 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.08/11.91 [2019-03-28 12:18:06,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.08/11.91 [2019-03-28 12:18:06,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.08/11.91 [2019-03-28 12:18:06,883 INFO L518 LassoAnalysis]: Proved termination. 25.08/11.91 [2019-03-28 12:18:06,883 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.08/11.91 Ranking function f(average_~y) = 1*average_~y 25.08/11.91 Supporting invariants [] 25.08/11.91 [2019-03-28 12:18:06,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.08/11.91 [2019-03-28 12:18:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:06,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:06,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:06,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:06,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,061 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.08/11.91 [2019-03-28 12:18:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:07,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:07,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,155 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.08/11.91 [2019-03-28 12:18:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:07,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:07,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:07,179 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 10 predicates after loop cannibalization 25.08/11.91 [2019-03-28 12:18:07,179 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 10 loop predicates 25.08/11.91 [2019-03-28 12:18:07,179 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9 Second operand 7 states. 25.08/11.91 [2019-03-28 12:18:07,332 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 150 states and 202 transitions. Complement of second has 126 states. 25.08/11.91 [2019-03-28 12:18:07,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states 25.08/11.91 [2019-03-28 12:18:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.08/11.91 [2019-03-28 12:18:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. 25.08/11.91 [2019-03-28 12:18:07,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 8 letters. Loop has 7 letters. 25.08/11.91 [2019-03-28 12:18:07,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:07,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 15 letters. Loop has 7 letters. 25.08/11.91 [2019-03-28 12:18:07,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:07,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 8 letters. Loop has 14 letters. 25.08/11.91 [2019-03-28 12:18:07,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:07,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 202 transitions. 25.08/11.91 [2019-03-28 12:18:07,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 25.08/11.91 [2019-03-28 12:18:07,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 56 states and 70 transitions. 25.08/11.91 [2019-03-28 12:18:07,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 25.08/11.91 [2019-03-28 12:18:07,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 25.08/11.91 [2019-03-28 12:18:07,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. 25.08/11.91 [2019-03-28 12:18:07,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.08/11.91 [2019-03-28 12:18:07,345 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. 25.08/11.91 [2019-03-28 12:18:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. 25.08/11.91 [2019-03-28 12:18:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. 25.08/11.91 [2019-03-28 12:18:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 25.08/11.91 [2019-03-28 12:18:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:07,349 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:07,349 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:07,349 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.08/11.91 [2019-03-28 12:18:07,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 25.08/11.91 [2019-03-28 12:18:07,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 25.08/11.91 [2019-03-28 12:18:07,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.08/11.91 [2019-03-28 12:18:07,351 INFO L119 BuchiIsEmpty]: Starting construction of run 25.08/11.91 [2019-03-28 12:18:07,351 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:07,351 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1] 25.08/11.91 [2019-03-28 12:18:07,352 INFO L794 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 793#L34 [65] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_2 0) (= |v_ULTIMATE.start_random_#res_2| v_ULTIMATE.start_random_~x~1_2)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_2|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 786#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 787#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 809#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 801#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 808#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 803#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 802#L45 25.08/11.91 [2019-03-28 12:18:07,352 INFO L796 eck$LassoCheckResult]: Loop: 802#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 782#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 799#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 810#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 781#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 783#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 788#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 790#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 804#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 805#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 802#L45 25.08/11.91 [2019-03-28 12:18:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash 809311150, now seen corresponding path program 2 times 25.08/11.91 [2019-03-28 12:18:07,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:07,365 INFO L82 PathProgramCache]: Analyzing trace with hash -645177008, now seen corresponding path program 2 times 25.08/11.91 [2019-03-28 12:18:07,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:07,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:07,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1592756413, now seen corresponding path program 2 times 25.08/11.91 [2019-03-28 12:18:07,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.08/11.91 [2019-03-28 12:18:07,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.08/11.91 [2019-03-28 12:18:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.08/11.91 [2019-03-28 12:18:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:07,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.08/11.91 [2019-03-28 12:18:07,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 25.08/11.91 [2019-03-28 12:18:07,601 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:07,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:07,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:07,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:07,602 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.08/11.91 [2019-03-28 12:18:07,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:07,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:07,602 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:07,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 25.08/11.91 [2019-03-28 12:18:07,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:07,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:07,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:07,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:07,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:07,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:07,667 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:07,667 INFO L412 LassoAnalysis]: Checking for nontermination... 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:07,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:07,671 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:07,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.08/11.91 [2019-03-28 12:18:07,675 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#res=0} Honda state: {average_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:07,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:07,702 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 25.08/11.91 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.08/11.91 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:07,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.08/11.91 [2019-03-28 12:18:07,734 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.08/11.91 [2019-03-28 12:18:08,563 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.08/11.91 [2019-03-28 12:18:08,565 INFO L216 LassoAnalysis]: Preferences: 25.08/11.91 [2019-03-28 12:18:08,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.08/11.91 [2019-03-28 12:18:08,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.08/11.91 [2019-03-28 12:18:08,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.08/11.91 [2019-03-28 12:18:08,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.08/11.91 [2019-03-28 12:18:08,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.08/11.91 [2019-03-28 12:18:08,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.08/11.91 [2019-03-28 12:18:08,566 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.08/11.91 [2019-03-28 12:18:08,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 25.08/11.91 [2019-03-28 12:18:08,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.08/11.91 [2019-03-28 12:18:08,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.08/11.91 [2019-03-28 12:18:08,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:08,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:08,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:08,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:08,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.08/11.91 [2019-03-28 12:18:08,632 INFO L300 LassoAnalysis]: Preprocessing complete. 25.08/11.91 [2019-03-28 12:18:08,632 INFO L497 LassoAnalysis]: Using template 'affine'. 25.08/11.91 [2019-03-28 12:18:08,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:08,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:08,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:08,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:08,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:08,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:08,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:08,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:08,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:08,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:08,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:08,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:08,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:08,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:08,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:08,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:08,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:08,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.08/11.91 [2019-03-28 12:18:08,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.08/11.91 Termination analysis: LINEAR_WITH_GUESSES 25.08/11.91 Number of strict supporting invariants: 0 25.08/11.91 Number of non-strict supporting invariants: 1 25.08/11.91 Consider only non-deceasing supporting invariants: true 25.08/11.91 Simplify termination arguments: true 25.08/11.91 Simplify supporting invariants: trueOverapproximate stem: false 25.08/11.91 [2019-03-28 12:18:08,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.08/11.91 [2019-03-28 12:18:08,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.08/11.91 [2019-03-28 12:18:08,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.08/11.91 [2019-03-28 12:18:08,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.08/11.91 [2019-03-28 12:18:08,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.08/11.91 [2019-03-28 12:18:08,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.08/11.91 [2019-03-28 12:18:08,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.08/11.91 [2019-03-28 12:18:08,644 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.08/11.91 [2019-03-28 12:18:08,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.08/11.91 [2019-03-28 12:18:08,646 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.08/11.91 [2019-03-28 12:18:08,647 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.08/11.91 [2019-03-28 12:18:08,647 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.08/11.91 [2019-03-28 12:18:08,647 INFO L518 LassoAnalysis]: Proved termination. 25.08/11.91 [2019-03-28 12:18:08,647 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.08/11.91 Ranking function f(average_~x) = 1*average_~x 25.08/11.91 Supporting invariants [] 25.08/11.91 [2019-03-28 12:18:08,648 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.08/11.91 [2019-03-28 12:18:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.08/11.91 [2019-03-28 12:18:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:08,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:08,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:08,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:08,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.08/11.91 [2019-03-28 12:18:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:08,779 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.08/11.91 [2019-03-28 12:18:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:08,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:08,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:08,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.08/11.91 [2019-03-28 12:18:08,973 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.08/11.91 [2019-03-28 12:18:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:08,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:09,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:09,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:09,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:09,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.08/11.91 [2019-03-28 12:18:09,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core 25.08/11.91 [2019-03-28 12:18:09,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.08/11.91 [2019-03-28 12:18:09,177 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 14 predicates after loop cannibalization 25.08/11.91 [2019-03-28 12:18:09,177 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 14 loop predicates 25.08/11.91 [2019-03-28 12:18:09,177 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 7 states. 25.08/11.91 [2019-03-28 12:18:09,677 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 1955 states and 2647 transitions. Complement of second has 1201 states. 25.08/11.91 [2019-03-28 12:18:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 1 accepting loop states 25.08/11.91 [2019-03-28 12:18:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 25.08/11.91 [2019-03-28 12:18:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. 25.08/11.91 [2019-03-28 12:18:09,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 8 letters. Loop has 10 letters. 25.08/11.91 [2019-03-28 12:18:09,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:09,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 18 letters. Loop has 10 letters. 25.08/11.91 [2019-03-28 12:18:09,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:09,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 8 letters. Loop has 20 letters. 25.08/11.91 [2019-03-28 12:18:09,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.08/11.91 [2019-03-28 12:18:09,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 2647 transitions. 25.08/11.91 [2019-03-28 12:18:09,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.08/11.91 [2019-03-28 12:18:09,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.08/11.91 [2019-03-28 12:18:09,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.08/11.91 [2019-03-28 12:18:09,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.08/11.91 [2019-03-28 12:18:09,713 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,713 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 25.08/11.91 [2019-03-28 12:18:09,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 25.08/11.91 [2019-03-28 12:18:09,714 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. 25.08/11.91 [2019-03-28 12:18:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.08/11.91 [2019-03-28 12:18:09,714 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 25.08/11.91 [2019-03-28 12:18:09,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.08/11.91 [2019-03-28 12:18:09,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.08/11.91 [2019-03-28 12:18:09,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.08/11.91 [2019-03-28 12:18:09,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.08/11.91 [2019-03-28 12:18:09,717 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,717 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,718 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,718 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.08/11.91 [2019-03-28 12:18:09,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.08/11.91 [2019-03-28 12:18:09,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.08/11.91 [2019-03-28 12:18:09,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.08/11.91 [2019-03-28 12:18:09,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:18:09 BasicIcfg 25.08/11.91 [2019-03-28 12:18:09,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.08/11.91 [2019-03-28 12:18:09,727 INFO L168 Benchmark]: Toolchain (without parser) took 7454.87 ms. Allocated memory was 649.6 MB in the beginning and 766.0 MB in the end (delta: 116.4 MB). Free memory was 558.4 MB in the beginning and 552.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 122.4 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,729 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.61 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 558.4 MB in the beginning and 637.5 MB in the end (delta: -79.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.39 ms. Allocated memory is still 670.0 MB. Free memory was 637.5 MB in the beginning and 636.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,731 INFO L168 Benchmark]: Boogie Preprocessor took 18.27 ms. Allocated memory is still 670.0 MB. Free memory was 636.1 MB in the beginning and 634.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,732 INFO L168 Benchmark]: RCFGBuilder took 243.78 ms. Allocated memory is still 670.0 MB. Free memory was 634.8 MB in the beginning and 617.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,732 INFO L168 Benchmark]: BlockEncodingV2 took 81.63 ms. Allocated memory is still 670.0 MB. Free memory was 617.8 MB in the beginning and 613.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,733 INFO L168 Benchmark]: TraceAbstraction took 183.62 ms. Allocated memory is still 670.0 MB. Free memory was 612.4 MB in the beginning and 601.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,733 INFO L168 Benchmark]: BuchiAutomizer took 6579.34 ms. Allocated memory was 670.0 MB in the beginning and 766.0 MB in the end (delta: 95.9 MB). Free memory was 601.5 MB in the beginning and 552.4 MB in the end (delta: 49.1 MB). Peak memory consumption was 145.1 MB. Max. memory is 50.3 GB. 25.08/11.91 [2019-03-28 12:18:09,738 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.08/11.91 --- Results --- 25.08/11.91 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.08/11.91 - StatisticsResult: Initial Icfg 25.08/11.91 19 locations, 24 edges 25.08/11.91 - StatisticsResult: Encoded RCFG 25.08/11.91 15 locations, 20 edges 25.08/11.91 * Results from de.uni_freiburg.informatik.ultimate.core: 25.08/11.91 - StatisticsResult: Toolchain Benchmarks 25.08/11.91 Benchmark results are: 25.08/11.91 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.08/11.91 * CACSL2BoogieTranslator took 298.61 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 558.4 MB in the beginning and 637.5 MB in the end (delta: -79.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 50.3 GB. 25.08/11.91 * Boogie Procedure Inliner took 44.39 ms. Allocated memory is still 670.0 MB. Free memory was 637.5 MB in the beginning and 636.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.08/11.91 * Boogie Preprocessor took 18.27 ms. Allocated memory is still 670.0 MB. Free memory was 636.1 MB in the beginning and 634.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 25.08/11.91 * RCFGBuilder took 243.78 ms. Allocated memory is still 670.0 MB. Free memory was 634.8 MB in the beginning and 617.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 25.08/11.91 * BlockEncodingV2 took 81.63 ms. Allocated memory is still 670.0 MB. Free memory was 617.8 MB in the beginning and 613.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 25.08/11.91 * TraceAbstraction took 183.62 ms. Allocated memory is still 670.0 MB. Free memory was 612.4 MB in the beginning and 601.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 25.08/11.91 * BuchiAutomizer took 6579.34 ms. Allocated memory was 670.0 MB in the beginning and 766.0 MB in the end (delta: 95.9 MB). Free memory was 601.5 MB in the beginning and 552.4 MB in the end (delta: 49.1 MB). Peak memory consumption was 145.1 MB. Max. memory is 50.3 GB. 25.08/11.91 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.08/11.91 - AllSpecificationsHoldResult: All specifications hold 25.08/11.91 We were not able to verify any specifiation because the program does not contain any specification. 25.08/11.91 - InvariantResult [Line: 32]: Loop Invariant 25.08/11.91 Derived loop invariant: 1 25.08/11.91 - InvariantResult [Line: 32]: Loop Invariant 25.08/11.91 Derived loop invariant: 1 25.08/11.91 - StatisticsResult: Ultimate Automizer benchmark data 25.08/11.91 CFG has 2 procedures, 15 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=15occurred 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, 6 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 6 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 25.08/11.91 - StatisticsResult: Constructed decomposition of program 25.08/11.91 Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function \old(x) and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 9 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. 25.08/11.91 - StatisticsResult: Timing statistics 25.08/11.91 BüchiAutomizer plugin needed 6.5s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/9 HoareTripleCheckerStatistics: 85 SDtfs, 128 SDslu, 129 SDs, 0 SdLazy, 258 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf92 smp95 dnf100 smp100 tf110 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.5s 25.08/11.91 - TerminationAnalysisResult: Termination proven 25.08/11.91 Buchi Automizer proved that your program is terminating 25.08/11.91 RESULT: Ultimate proved your program to be correct! 25.08/11.91 !SESSION 2019-03-28 12:17:58.943 ----------------------------------------------- 25.08/11.91 eclipse.buildId=unknown 25.08/11.91 java.version=1.8.0_181 25.08/11.91 java.vendor=Oracle Corporation 25.08/11.91 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.08/11.91 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 25.08/11.91 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 25.08/11.91 25.08/11.91 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:18:09.977 25.08/11.91 !MESSAGE The workspace will exit with unsaved changes in this session. 25.08/11.91 Received shutdown request... 25.08/11.91 Ultimate: 25.08/11.91 GTK+ Version Check 25.08/11.91 EOF