24.27/13.65 YES 24.27/13.65 24.27/13.65 Ultimate: Cannot open display: 24.27/13.65 This is Ultimate 0.1.24-8dc7c08-m 24.27/13.65 [2019-03-28 12:00:01,249 INFO L170 SettingsManager]: Resetting all preferences to default values... 24.27/13.65 [2019-03-28 12:00:01,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 24.27/13.65 [2019-03-28 12:00:01,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 24.27/13.65 [2019-03-28 12:00:01,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 24.27/13.65 [2019-03-28 12:00:01,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 24.27/13.65 [2019-03-28 12:00:01,267 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 24.27/13.65 [2019-03-28 12:00:01,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 24.27/13.65 [2019-03-28 12:00:01,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 24.27/13.65 [2019-03-28 12:00:01,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 24.27/13.65 [2019-03-28 12:00:01,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 24.27/13.65 [2019-03-28 12:00:01,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 24.27/13.65 [2019-03-28 12:00:01,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 24.27/13.65 [2019-03-28 12:00:01,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 24.27/13.65 [2019-03-28 12:00:01,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 24.27/13.65 [2019-03-28 12:00:01,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 24.27/13.65 [2019-03-28 12:00:01,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 24.27/13.65 [2019-03-28 12:00:01,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 24.27/13.65 [2019-03-28 12:00:01,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 24.27/13.65 [2019-03-28 12:00:01,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 24.27/13.65 [2019-03-28 12:00:01,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 24.27/13.65 [2019-03-28 12:00:01,285 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 24.27/13.65 [2019-03-28 12:00:01,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 24.27/13.65 [2019-03-28 12:00:01,286 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 24.27/13.65 [2019-03-28 12:00:01,287 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 24.27/13.65 [2019-03-28 12:00:01,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 24.27/13.65 [2019-03-28 12:00:01,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 24.27/13.65 [2019-03-28 12:00:01,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 24.27/13.65 [2019-03-28 12:00:01,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 24.27/13.65 [2019-03-28 12:00:01,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 24.27/13.65 [2019-03-28 12:00:01,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 24.27/13.65 [2019-03-28 12:00:01,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 24.27/13.65 [2019-03-28 12:00:01,293 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 24.27/13.65 [2019-03-28 12:00:01,308 INFO L110 SettingsManager]: Loading preferences was successful 24.27/13.65 [2019-03-28 12:00:01,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 24.27/13.65 [2019-03-28 12:00:01,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 24.27/13.65 [2019-03-28 12:00:01,309 INFO L133 SettingsManager]: * Rewrite not-equals=true 24.27/13.65 [2019-03-28 12:00:01,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 24.27/13.65 [2019-03-28 12:00:01,310 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 24.27/13.65 [2019-03-28 12:00:01,310 INFO L133 SettingsManager]: * Use SBE=true 24.27/13.65 [2019-03-28 12:00:01,310 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 24.27/13.65 [2019-03-28 12:00:01,310 INFO L133 SettingsManager]: * Use old map elimination=false 24.27/13.65 [2019-03-28 12:00:01,310 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 24.27/13.65 [2019-03-28 12:00:01,310 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 24.27/13.65 [2019-03-28 12:00:01,311 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 24.27/13.65 [2019-03-28 12:00:01,311 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 24.27/13.65 [2019-03-28 12:00:01,311 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 24.27/13.65 [2019-03-28 12:00:01,311 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.65 [2019-03-28 12:00:01,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 24.27/13.65 [2019-03-28 12:00:01,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 24.27/13.65 [2019-03-28 12:00:01,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE 24.27/13.65 [2019-03-28 12:00:01,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 24.27/13.65 [2019-03-28 12:00:01,312 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 24.27/13.65 [2019-03-28 12:00:01,312 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 24.27/13.65 [2019-03-28 12:00:01,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 24.27/13.65 [2019-03-28 12:00:01,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 24.27/13.65 [2019-03-28 12:00:01,313 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 24.27/13.65 [2019-03-28 12:00:01,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.27/13.65 [2019-03-28 12:00:01,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 24.27/13.65 [2019-03-28 12:00:01,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 24.27/13.65 [2019-03-28 12:00:01,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 24.27/13.65 [2019-03-28 12:00:01,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 24.27/13.65 [2019-03-28 12:00:01,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 24.27/13.65 [2019-03-28 12:00:01,353 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 24.27/13.65 [2019-03-28 12:00:01,357 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 24.27/13.65 [2019-03-28 12:00:01,358 INFO L271 PluginConnector]: Initializing CDTParser... 24.27/13.65 [2019-03-28 12:00:01,358 INFO L276 PluginConnector]: CDTParser initialized 24.27/13.65 [2019-03-28 12:00:01,359 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 24.27/13.65 [2019-03-28 12:00:01,429 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/55fb2ef9a36241679ece8642e5561a40/FLAG5d8f3252d 24.27/13.65 [2019-03-28 12:00:01,767 INFO L307 CDTParser]: Found 1 translation units. 24.27/13.65 [2019-03-28 12:00:01,767 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 24.27/13.65 [2019-03-28 12:00:01,774 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/55fb2ef9a36241679ece8642e5561a40/FLAG5d8f3252d 24.27/13.65 [2019-03-28 12:00:02,173 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/55fb2ef9a36241679ece8642e5561a40 24.27/13.65 [2019-03-28 12:00:02,184 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 24.27/13.65 [2019-03-28 12:00:02,186 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 24.27/13.65 [2019-03-28 12:00:02,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 24.27/13.65 [2019-03-28 12:00:02,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 24.27/13.65 [2019-03-28 12:00:02,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 24.27/13.65 [2019-03-28 12:00:02,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605abf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:02,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 24.27/13.65 [2019-03-28 12:00:02,223 INFO L176 MainTranslator]: Built tables and reachable declarations 24.27/13.65 [2019-03-28 12:00:02,384 INFO L206 PostProcessor]: Analyzing one entry point: main 24.27/13.65 [2019-03-28 12:00:02,389 INFO L191 MainTranslator]: Completed pre-run 24.27/13.65 [2019-03-28 12:00:02,407 INFO L206 PostProcessor]: Analyzing one entry point: main 24.27/13.65 [2019-03-28 12:00:02,481 INFO L195 MainTranslator]: Completed translation 24.27/13.65 [2019-03-28 12:00:02,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02 WrapperNode 24.27/13.65 [2019-03-28 12:00:02,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 24.27/13.65 [2019-03-28 12:00:02,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 24.27/13.65 [2019-03-28 12:00:02,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 24.27/13.65 [2019-03-28 12:00:02,483 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 24.27/13.65 [2019-03-28 12:00:02,493 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:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,498 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:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 24.27/13.65 [2019-03-28 12:00:02,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 24.27/13.65 [2019-03-28 12:00:02,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 24.27/13.65 [2019-03-28 12:00:02,519 INFO L276 PluginConnector]: Boogie Preprocessor initialized 24.27/13.65 [2019-03-28 12:00:02,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 24.27/13.65 [2019-03-28 12:00:02,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 24.27/13.65 [2019-03-28 12:00:02,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... 24.27/13.65 [2019-03-28 12:00:02,539 INFO L276 PluginConnector]: RCFGBuilder initialized 24.27/13.65 [2019-03-28 12:00:02,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (1/1) ... 24.27/13.65 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.65 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 24.27/13.65 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.27/13.65 [2019-03-28 12:00:02,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 24.27/13.65 [2019-03-28 12:00:02,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 24.27/13.65 [2019-03-28 12:00:02,746 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 24.27/13.65 [2019-03-28 12:00:02,746 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 24.27/13.65 [2019-03-28 12:00:02,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:02 BoogieIcfgContainer 24.27/13.65 [2019-03-28 12:00:02,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 24.27/13.65 [2019-03-28 12:00:02,748 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 24.27/13.65 [2019-03-28 12:00:02,748 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 24.27/13.65 [2019-03-28 12:00:02,750 INFO L276 PluginConnector]: BlockEncodingV2 initialized 24.27/13.65 [2019-03-28 12:00:02,751 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:02" (1/1) ... 24.27/13.65 [2019-03-28 12:00:02,766 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 24.27/13.65 [2019-03-28 12:00:02,767 INFO L258 BlockEncoder]: Using Remove infeasible edges 24.27/13.65 [2019-03-28 12:00:02,768 INFO L263 BlockEncoder]: Using Maximize final states 24.27/13.65 [2019-03-28 12:00:02,769 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 24.27/13.65 [2019-03-28 12:00:02,769 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 24.27/13.65 [2019-03-28 12:00:02,771 INFO L296 BlockEncoder]: Using Remove sink states 24.27/13.65 [2019-03-28 12:00:02,772 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 24.27/13.65 [2019-03-28 12:00:02,772 INFO L179 BlockEncoder]: Using Rewrite not-equals 24.27/13.65 [2019-03-28 12:00:02,787 INFO L185 BlockEncoder]: Using Use SBE 24.27/13.65 [2019-03-28 12:00:02,803 INFO L200 BlockEncoder]: SBE split 1 edges 24.27/13.65 [2019-03-28 12:00:02,808 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 24.27/13.65 [2019-03-28 12:00:02,810 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.27/13.65 [2019-03-28 12:00:02,821 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 24.27/13.65 [2019-03-28 12:00:02,823 INFO L70 RemoveSinkStates]: Removed 6 edges and 2 locations by removing sink states 24.27/13.65 [2019-03-28 12:00:02,824 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 24.27/13.65 [2019-03-28 12:00:02,824 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.27/13.65 [2019-03-28 12:00:02,828 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 24.27/13.65 [2019-03-28 12:00:02,828 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 24.27/13.65 [2019-03-28 12:00:02,829 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 24.27/13.65 [2019-03-28 12:00:02,829 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.27/13.65 [2019-03-28 12:00:02,829 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 24.27/13.65 [2019-03-28 12:00:02,829 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 24.27/13.65 [2019-03-28 12:00:02,830 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges 24.27/13.65 [2019-03-28 12:00:02,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:02 BasicIcfg 24.27/13.65 [2019-03-28 12:00:02,830 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 24.27/13.65 [2019-03-28 12:00:02,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 24.27/13.65 [2019-03-28 12:00:02,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... 24.27/13.65 [2019-03-28 12:00:02,835 INFO L276 PluginConnector]: TraceAbstraction initialized 24.27/13.65 [2019-03-28 12:00:02,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:00:02" (1/4) ... 24.27/13.65 [2019-03-28 12:00:02,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14606a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:00:02, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:02,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (2/4) ... 24.27/13.65 [2019-03-28 12:00:02,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14606a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:00:02, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:02,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:02" (3/4) ... 24.27/13.65 [2019-03-28 12:00:02,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14606a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:02, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:02,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:02" (4/4) ... 24.27/13.65 [2019-03-28 12:00:02,839 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.27/13.65 [2019-03-28 12:00:02,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 24.27/13.65 [2019-03-28 12:00:02,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 24.27/13.65 [2019-03-28 12:00:02,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 24.27/13.65 [2019-03-28 12:00:02,905 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.27/13.65 [2019-03-28 12:00:02,906 INFO L382 AbstractCegarLoop]: Interprodecural is true 24.27/13.65 [2019-03-28 12:00:02,906 INFO L383 AbstractCegarLoop]: Hoare is true 24.27/13.65 [2019-03-28 12:00:02,906 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 24.27/13.65 [2019-03-28 12:00:02,906 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 24.27/13.65 [2019-03-28 12:00:02,906 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.27/13.65 [2019-03-28 12:00:02,907 INFO L387 AbstractCegarLoop]: Difference is false 24.27/13.65 [2019-03-28 12:00:02,907 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 24.27/13.65 [2019-03-28 12:00:02,907 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 24.27/13.65 [2019-03-28 12:00:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 24.27/13.65 [2019-03-28 12:00:02,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 24.27/13.65 [2019-03-28 12:00:02,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 24.27/13.65 [2019-03-28 12:00:02,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 24.27/13.65 [2019-03-28 12:00:02,981 INFO L451 ceAbstractionStarter]: At program point L24-2(lines 24 27) the Hoare annotation is: true 24.27/13.65 [2019-03-28 12:00:03,001 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 22 29) the Hoare annotation is: true 24.27/13.65 [2019-03-28 12:00:03,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:03 BasicIcfg 24.27/13.65 [2019-03-28 12:00:03,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 24.27/13.65 [2019-03-28 12:00:03,011 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 24.27/13.65 [2019-03-28 12:00:03,011 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 24.27/13.65 [2019-03-28 12:00:03,014 INFO L276 PluginConnector]: BuchiAutomizer initialized 24.27/13.65 [2019-03-28 12:00:03,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.27/13.65 [2019-03-28 12:00:03,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:00:02" (1/5) ... 24.27/13.65 [2019-03-28 12:00:03,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:00:03, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:03,016 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.27/13.65 [2019-03-28 12:00:03,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:02" (2/5) ... 24.27/13.65 [2019-03-28 12:00:03,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:00:03, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:03,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.27/13.65 [2019-03-28 12:00:03,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:02" (3/5) ... 24.27/13.65 [2019-03-28 12:00:03,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:03, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:03,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.27/13.65 [2019-03-28 12:00:03,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:02" (4/5) ... 24.27/13.65 [2019-03-28 12:00:03,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:03, skipping insertion in model container 24.27/13.65 [2019-03-28 12:00:03,018 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.27/13.65 [2019-03-28 12:00:03,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:03" (5/5) ... 24.27/13.65 [2019-03-28 12:00:03,020 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.27/13.65 [2019-03-28 12:00:03,047 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.27/13.65 [2019-03-28 12:00:03,048 INFO L374 BuchiCegarLoop]: Interprodecural is true 24.27/13.65 [2019-03-28 12:00:03,048 INFO L375 BuchiCegarLoop]: Hoare is true 24.27/13.65 [2019-03-28 12:00:03,048 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 24.27/13.65 [2019-03-28 12:00:03,048 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 24.27/13.65 [2019-03-28 12:00:03,048 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.27/13.65 [2019-03-28 12:00:03,048 INFO L379 BuchiCegarLoop]: Difference is false 24.27/13.65 [2019-03-28 12:00:03,049 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 24.27/13.65 [2019-03-28 12:00:03,049 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 24.27/13.65 [2019-03-28 12:00:03,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 24.27/13.65 [2019-03-28 12:00:03,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 24.27/13.65 [2019-03-28 12:00:03,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.27/13.65 [2019-03-28 12:00:03,071 INFO L119 BuchiIsEmpty]: Starting construction of run 24.27/13.65 [2019-03-28 12:00:03,077 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 24.27/13.65 [2019-03-28 12:00:03,077 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 24.27/13.65 [2019-03-28 12:00:03,077 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 24.27/13.65 [2019-03-28 12:00:03,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 24.27/13.65 [2019-03-28 12:00:03,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 24.27/13.65 [2019-03-28 12:00:03,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.27/13.65 [2019-03-28 12:00:03,078 INFO L119 BuchiIsEmpty]: Starting construction of run 24.27/13.65 [2019-03-28 12:00:03,078 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 24.27/13.65 [2019-03-28 12:00:03,079 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 24.27/13.65 [2019-03-28 12:00:03,084 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [59] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~x~0_12 10000) (<= v_ULTIMATE.start_main_~z~0_10 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_12 10000)) (<= v_ULTIMATE.start_main_~y~0_15 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 5#L22-2true 24.27/13.65 [2019-03-28 12:00:03,084 INFO L796 eck$LassoCheckResult]: Loop: 5#L22-2true [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 4#L24-2true [58] L24-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~y~0_14) (= (+ v_ULTIMATE.start_main_~y~0_14 v_ULTIMATE.start_main_~x~0_11) v_ULTIMATE.start_main_~y~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 5#L22-2true 24.27/13.65 [2019-03-28 12:00:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.65 [2019-03-28 12:00:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash 90, now seen corresponding path program 1 times 24.27/13.65 [2019-03-28 12:00:03,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.65 [2019-03-28 12:00:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.65 [2019-03-28 12:00:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.65 [2019-03-28 12:00:03,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.65 [2019-03-28 12:00:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.65 [2019-03-28 12:00:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.65 [2019-03-28 12:00:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.65 [2019-03-28 12:00:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.65 [2019-03-28 12:00:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2507, now seen corresponding path program 1 times 24.27/13.65 [2019-03-28 12:00:03,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.65 [2019-03-28 12:00:03,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:03,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash 88036, now seen corresponding path program 1 times 24.27/13.66 [2019-03-28 12:00:03,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:03,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:03,235 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:03,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:03,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:03,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:03,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.27/13.66 [2019-03-28 12:00:03,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:03,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:03,238 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:03,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 24.27/13.66 [2019-03-28 12:00:03,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:03,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:03,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:03,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:03,333 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:03,334 INFO L412 LassoAnalysis]: Checking for nontermination... 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:03,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:03,341 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:03,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:03,376 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:05,598 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.27/13.66 [2019-03-28 12:00:05,601 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:05,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:05,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:05,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:05,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.27/13.66 [2019-03-28 12:00:05,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:05,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:05,602 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:05,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 24.27/13.66 [2019-03-28 12:00:05,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:05,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:05,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:05,672 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:05,678 INFO L497 LassoAnalysis]: Using template 'affine'. 24.27/13.66 [2019-03-28 12:00:05,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:05,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:05,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:05,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:05,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:05,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:05,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:05,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:05,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:05,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:05,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:05,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:05,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:05,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:05,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:05,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:05,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:05,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:05,704 INFO L497 LassoAnalysis]: Using template '2-nested'. 24.27/13.66 [2019-03-28 12:00:05,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:05,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:05,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:05,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:05,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:05,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 24.27/13.66 [2019-03-28 12:00:05,708 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:05,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:05,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.27/13.66 [2019-03-28 12:00:05,747 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 24.27/13.66 [2019-03-28 12:00:05,747 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. 24.27/13.66 [2019-03-28 12:00:05,750 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.27/13.66 [2019-03-28 12:00:05,750 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.27/13.66 [2019-03-28 12:00:05,750 INFO L518 LassoAnalysis]: Proved termination. 24.27/13.66 [2019-03-28 12:00:05,751 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.27/13.66 Ranking function 2-nested ranking function: 24.27/13.66 f0 = 1*ULTIMATE.start_main_~x~0 24.27/13.66 f1 = 1*ULTIMATE.start_main_~y~0 24.27/13.66 Supporting invariants [] 24.27/13.66 [2019-03-28 12:00:05,753 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.27/13.66 [2019-03-28 12:00:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:05,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:05,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:05,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:05,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.27/13.66 [2019-03-28 12:00:06,150 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization 24.27/13.66 [2019-03-28 12:00:06,155 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 12 loop predicates 24.27/13.66 [2019-03-28 12:00:06,157 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 24.27/13.66 [2019-03-28 12:00:06,721 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 19 states and 30 transitions. Complement of second has 18 states. 24.27/13.66 [2019-03-28 12:00:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states 24.27/13.66 [2019-03-28 12:00:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 24.27/13.66 [2019-03-28 12:00:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. 24.27/13.66 [2019-03-28 12:00:06,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 1 letters. Loop has 2 letters. 24.27/13.66 [2019-03-28 12:00:06,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:06,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 3 letters. Loop has 2 letters. 24.27/13.66 [2019-03-28 12:00:06,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:06,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 1 letters. Loop has 4 letters. 24.27/13.66 [2019-03-28 12:00:06,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:06,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 30 transitions. 24.27/13.66 [2019-03-28 12:00:06,738 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 24.27/13.66 [2019-03-28 12:00:06,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 18 transitions. 24.27/13.66 [2019-03-28 12:00:06,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 24.27/13.66 [2019-03-28 12:00:06,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 24.27/13.66 [2019-03-28 12:00:06,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. 24.27/13.66 [2019-03-28 12:00:06,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.27/13.66 [2019-03-28 12:00:06,744 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. 24.27/13.66 [2019-03-28 12:00:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. 24.27/13.66 [2019-03-28 12:00:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. 24.27/13.66 [2019-03-28 12:00:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 24.27/13.66 [2019-03-28 12:00:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 24.27/13.66 [2019-03-28 12:00:06,774 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 24.27/13.66 [2019-03-28 12:00:06,774 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. 24.27/13.66 [2019-03-28 12:00:06,774 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 24.27/13.66 [2019-03-28 12:00:06,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. 24.27/13.66 [2019-03-28 12:00:06,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 24.27/13.66 [2019-03-28 12:00:06,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.27/13.66 [2019-03-28 12:00:06,775 INFO L119 BuchiIsEmpty]: Starting construction of run 24.27/13.66 [2019-03-28 12:00:06,775 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 24.27/13.66 [2019-03-28 12:00:06,776 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 24.27/13.66 [2019-03-28 12:00:06,776 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [59] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~x~0_12 10000) (<= v_ULTIMATE.start_main_~z~0_10 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_12 10000)) (<= v_ULTIMATE.start_main_~y~0_15 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 98#L22-2 [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 99#L24-2 [40] L24-2-->L24-2: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_9 1) v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_7 1)) (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~z~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 100#L24-2 24.27/13.66 [2019-03-28 12:00:06,776 INFO L796 eck$LassoCheckResult]: Loop: 100#L24-2 [40] L24-2-->L24-2: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_9 1) v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_7 1)) (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~z~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 100#L24-2 24.27/13.66 [2019-03-28 12:00:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash 88018, now seen corresponding path program 1 times 24.27/13.66 [2019-03-28 12:00:06,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:06,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times 24.27/13.66 [2019-03-28 12:00:06,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:06,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2728598, now seen corresponding path program 2 times 24.27/13.66 [2019-03-28 12:00:06,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:06,823 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:06,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:06,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:06,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:06,824 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.27/13.66 [2019-03-28 12:00:06,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:06,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:06,824 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:06,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 24.27/13.66 [2019-03-28 12:00:06,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:06,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:06,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:06,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:06,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:06,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:06,863 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:06,863 INFO L412 LassoAnalysis]: Checking for nontermination... 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:06,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:06,868 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:06,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.27/13.66 [2019-03-28 12:00:06,874 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:06,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:06,903 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:06,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.27/13.66 [2019-03-28 12:00:06,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:06,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:06,935 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:06,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:06,967 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:07,225 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.27/13.66 [2019-03-28 12:00:07,227 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:07,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:07,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:07,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:07,228 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.27/13.66 [2019-03-28 12:00:07,228 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,228 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:07,229 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:07,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 24.27/13.66 [2019-03-28 12:00:07,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:07,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:07,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,268 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:07,268 INFO L497 LassoAnalysis]: Using template 'affine'. 24.27/13.66 [2019-03-28 12:00:07,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:07,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:07,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:07,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:07,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:07,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:07,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:07,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:07,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:07,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:07,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:07,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:07,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:07,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:07,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:07,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:07,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:07,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:07,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:07,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:07,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:07,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:07,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:07,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:07,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:07,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:07,282 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.27/13.66 [2019-03-28 12:00:07,287 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 24.27/13.66 [2019-03-28 12:00:07,288 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 24.27/13.66 [2019-03-28 12:00:07,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.27/13.66 [2019-03-28 12:00:07,288 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.27/13.66 [2019-03-28 12:00:07,289 INFO L518 LassoAnalysis]: Proved termination. 24.27/13.66 [2019-03-28 12:00:07,289 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.27/13.66 Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 24.27/13.66 Supporting invariants [] 24.27/13.66 [2019-03-28 12:00:07,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.27/13.66 [2019-03-28 12:00:07,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:07,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:07,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:07,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:07,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.27/13.66 [2019-03-28 12:00:07,317 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 24.27/13.66 [2019-03-28 12:00:07,317 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 1 loop predicates 24.27/13.66 [2019-03-28 12:00:07,317 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. 24.27/13.66 [2019-03-28 12:00:07,324 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 10 states and 15 transitions. Complement of second has 2 states. 24.27/13.66 [2019-03-28 12:00:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states 24.27/13.66 [2019-03-28 12:00:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 24.27/13.66 [2019-03-28 12:00:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. 24.27/13.66 [2019-03-28 12:00:07,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. 24.27/13.66 [2019-03-28 12:00:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. 24.27/13.66 [2019-03-28 12:00:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:07,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. 24.27/13.66 [2019-03-28 12:00:07,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:07,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 15 transitions. 24.27/13.66 [2019-03-28 12:00:07,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 24.27/13.66 [2019-03-28 12:00:07,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 15 transitions. 24.27/13.66 [2019-03-28 12:00:07,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 24.27/13.66 [2019-03-28 12:00:07,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 24.27/13.66 [2019-03-28 12:00:07,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. 24.27/13.66 [2019-03-28 12:00:07,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.27/13.66 [2019-03-28 12:00:07,346 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. 24.27/13.66 [2019-03-28 12:00:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. 24.27/13.66 [2019-03-28 12:00:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 24.27/13.66 [2019-03-28 12:00:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 24.27/13.66 [2019-03-28 12:00:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 24.27/13.66 [2019-03-28 12:00:07,349 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 24.27/13.66 [2019-03-28 12:00:07,349 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 24.27/13.66 [2019-03-28 12:00:07,349 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 24.27/13.66 [2019-03-28 12:00:07,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 24.27/13.66 [2019-03-28 12:00:07,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 24.27/13.66 [2019-03-28 12:00:07,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.27/13.66 [2019-03-28 12:00:07,350 INFO L119 BuchiIsEmpty]: Starting construction of run 24.27/13.66 [2019-03-28 12:00:07,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 24.27/13.66 [2019-03-28 12:00:07,350 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 24.27/13.66 [2019-03-28 12:00:07,351 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [59] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~x~0_12 10000) (<= v_ULTIMATE.start_main_~z~0_10 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_12 10000)) (<= v_ULTIMATE.start_main_~y~0_15 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 143#L22-2 [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 144#L24-2 [40] L24-2-->L24-2: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_9 1) v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_7 1)) (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~z~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 145#L24-2 24.27/13.66 [2019-03-28 12:00:07,351 INFO L796 eck$LassoCheckResult]: Loop: 145#L24-2 [58] L24-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~y~0_14) (= (+ v_ULTIMATE.start_main_~y~0_14 v_ULTIMATE.start_main_~x~0_11) v_ULTIMATE.start_main_~y~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 147#L22-2 [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 148#L24-2 [40] L24-2-->L24-2: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_9 1) v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_7 1)) (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~z~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 145#L24-2 24.27/13.66 [2019-03-28 12:00:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 88018, now seen corresponding path program 3 times 24.27/13.66 [2019-03-28 12:00:07,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash 87057, now seen corresponding path program 1 times 24.27/13.66 [2019-03-28 12:00:07,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1672765792, now seen corresponding path program 1 times 24.27/13.66 [2019-03-28 12:00:07,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:07,411 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:07,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:07,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:07,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:07,412 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.27/13.66 [2019-03-28 12:00:07,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:07,413 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:07,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 24.27/13.66 [2019-03-28 12:00:07,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:07,413 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:07,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,490 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:07,491 INFO L412 LassoAnalysis]: Checking for nontermination... 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:07,497 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:07,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.27/13.66 [2019-03-28 12:00:07,502 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:07,530 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:07,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.27/13.66 [2019-03-28 12:00:07,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:07,563 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:07,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. 24.27/13.66 [2019-03-28 12:00:07,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:07,607 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:07,648 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:07,925 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.27/13.66 [2019-03-28 12:00:07,928 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:07,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:07,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:07,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:07,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.27/13.66 [2019-03-28 12:00:07,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:07,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:07,929 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:07,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 24.27/13.66 [2019-03-28 12:00:07,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:07,929 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:07,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:08,000 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:08,000 INFO L497 LassoAnalysis]: Using template 'affine'. 24.27/13.66 [2019-03-28 12:00:08,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:08,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:08,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:08,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:08,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:08,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:08,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:08,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:08,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:08,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:08,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:08,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:08,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:08,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:08,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:08,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:08,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:08,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:08,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:08,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:08,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:08,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:08,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:08,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:08,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:08,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:08,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:08,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:08,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:08,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:08,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:08,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:08,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:08,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:08,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:08,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.27/13.66 [2019-03-28 12:00:08,043 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.27/13.66 [2019-03-28 12:00:08,043 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. 24.27/13.66 [2019-03-28 12:00:08,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.27/13.66 [2019-03-28 12:00:08,043 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.27/13.66 [2019-03-28 12:00:08,044 INFO L518 LassoAnalysis]: Proved termination. 24.27/13.66 [2019-03-28 12:00:08,044 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.27/13.66 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 24.27/13.66 Supporting invariants [] 24.27/13.66 [2019-03-28 12:00:08,044 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.27/13.66 [2019-03-28 12:00:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:08,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:08,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:08,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:08,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.27/13.66 [2019-03-28 12:00:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,105 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.27/13.66 [2019-03-28 12:00:08,105 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 24.27/13.66 [2019-03-28 12:00:08,106 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 24.27/13.66 [2019-03-28 12:00:08,106 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 4 states. 24.27/13.66 [2019-03-28 12:00:08,172 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 24 states and 43 transitions. Complement of second has 17 states. 24.27/13.66 [2019-03-28 12:00:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states 24.27/13.66 [2019-03-28 12:00:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 24.27/13.66 [2019-03-28 12:00:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. 24.27/13.66 [2019-03-28 12:00:08,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 3 letters. 24.27/13.66 [2019-03-28 12:00:08,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:08,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. 24.27/13.66 [2019-03-28 12:00:08,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:08,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 3 letters. Loop has 6 letters. 24.27/13.66 [2019-03-28 12:00:08,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:08,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 43 transitions. 24.27/13.66 [2019-03-28 12:00:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 24.27/13.66 [2019-03-28 12:00:08,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 37 transitions. 24.27/13.66 [2019-03-28 12:00:08,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 24.27/13.66 [2019-03-28 12:00:08,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 24.27/13.66 [2019-03-28 12:00:08,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 37 transitions. 24.27/13.66 [2019-03-28 12:00:08,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 24.27/13.66 [2019-03-28 12:00:08,183 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. 24.27/13.66 [2019-03-28 12:00:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 37 transitions. 24.27/13.66 [2019-03-28 12:00:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. 24.27/13.66 [2019-03-28 12:00:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 24.27/13.66 [2019-03-28 12:00:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. 24.27/13.66 [2019-03-28 12:00:08,187 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 24.27/13.66 [2019-03-28 12:00:08,187 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 24.27/13.66 [2019-03-28 12:00:08,187 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 24.27/13.66 [2019-03-28 12:00:08,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. 24.27/13.66 [2019-03-28 12:00:08,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 24.27/13.66 [2019-03-28 12:00:08,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.27/13.66 [2019-03-28 12:00:08,188 INFO L119 BuchiIsEmpty]: Starting construction of run 24.27/13.66 [2019-03-28 12:00:08,188 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.27/13.66 [2019-03-28 12:00:08,189 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 24.27/13.66 [2019-03-28 12:00:08,189 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY [59] ULTIMATE.startENTRY-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~x~0_12 10000) (<= v_ULTIMATE.start_main_~z~0_10 10000) (<= 0 (+ v_ULTIMATE.start_main_~x~0_12 10000)) (<= v_ULTIMATE.start_main_~y~0_15 10000)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_15, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_10, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_4|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 237#L22-2 [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 247#L24-2 [40] L24-2-->L24-2: Formula: (and (= (+ v_ULTIMATE.start_main_~x~0_9 1) v_ULTIMATE.start_main_~x~0_8) (= v_ULTIMATE.start_main_~z~0_8 (+ v_ULTIMATE.start_main_~z~0_7 1)) (< v_ULTIMATE.start_main_~y~0_9 v_ULTIMATE.start_main_~z~0_8)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~post5=|v_ULTIMATE.start_main_#t~post5_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~post5, ULTIMATE.start_main_#t~post4] 243#L24-2 [58] L24-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~y~0_14) (= (+ v_ULTIMATE.start_main_~y~0_14 v_ULTIMATE.start_main_~x~0_11) v_ULTIMATE.start_main_~y~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 239#L22-2 24.27/13.66 [2019-03-28 12:00:08,189 INFO L796 eck$LassoCheckResult]: Loop: 239#L22-2 [48] L22-2-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_7 (+ v_ULTIMATE.start_main_~x~0_6 1)) (<= 1 v_ULTIMATE.start_main_~y~0_7)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~x~0] 238#L24-2 [58] L24-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~z~0_9 v_ULTIMATE.start_main_~y~0_14) (= (+ v_ULTIMATE.start_main_~y~0_14 v_ULTIMATE.start_main_~x~0_11) v_ULTIMATE.start_main_~y~0_13)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_14, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_13, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_9, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0] 239#L22-2 24.27/13.66 [2019-03-28 12:00:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2728616, now seen corresponding path program 2 times 24.27/13.66 [2019-03-28 12:00:08,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2507, now seen corresponding path program 2 times 24.27/13.66 [2019-03-28 12:00:08,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1672765774, now seen corresponding path program 3 times 24.27/13.66 [2019-03-28 12:00:08,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.27/13.66 [2019-03-28 12:00:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.27/13.66 [2019-03-28 12:00:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.27/13.66 [2019-03-28 12:00:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.27/13.66 [2019-03-28 12:00:08,236 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:08,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:08,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:08,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:08,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true 24.27/13.66 [2019-03-28 12:00:08,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:08,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:08,237 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:08,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 24.27/13.66 [2019-03-28 12:00:08,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:08,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:08,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:08,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:08,277 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:08,277 INFO L412 LassoAnalysis]: Checking for nontermination... 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:08,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:08,282 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 24.27/13.66 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 24.27/13.66 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:08,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 24.27/13.66 [2019-03-28 12:00:08,315 INFO L163 nArgumentSynthesizer]: Using integer mode. 24.27/13.66 [2019-03-28 12:00:10,605 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 24.27/13.66 [2019-03-28 12:00:10,608 INFO L216 LassoAnalysis]: Preferences: 24.27/13.66 [2019-03-28 12:00:10,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.27/13.66 [2019-03-28 12:00:10,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.27/13.66 [2019-03-28 12:00:10,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.27/13.66 [2019-03-28 12:00:10,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.27/13.66 [2019-03-28 12:00:10,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.27/13.66 [2019-03-28 12:00:10,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.27/13.66 [2019-03-28 12:00:10,609 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.27/13.66 [2019-03-28 12:00:10,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 24.27/13.66 [2019-03-28 12:00:10,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.27/13.66 [2019-03-28 12:00:10,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.27/13.66 [2019-03-28 12:00:10,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.27/13.66 [2019-03-28 12:00:10,643 INFO L300 LassoAnalysis]: Preprocessing complete. 24.27/13.66 [2019-03-28 12:00:10,643 INFO L497 LassoAnalysis]: Using template 'affine'. 24.27/13.66 [2019-03-28 12:00:10,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:10,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:10,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:10,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:10,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:10,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:10,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:10,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:10,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:10,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:10,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:10,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:10,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:10,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:10,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.27/13.66 [2019-03-28 12:00:10,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:10,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:10,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.27/13.66 [2019-03-28 12:00:10,654 INFO L497 LassoAnalysis]: Using template '2-nested'. 24.27/13.66 [2019-03-28 12:00:10,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.27/13.66 Termination analysis: LINEAR_WITH_GUESSES 24.27/13.66 Number of strict supporting invariants: 0 24.27/13.66 Number of non-strict supporting invariants: 1 24.27/13.66 Consider only non-deceasing supporting invariants: true 24.27/13.66 Simplify termination arguments: true 24.27/13.66 Simplify supporting invariants: trueOverapproximate stem: false 24.27/13.66 [2019-03-28 12:00:10,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.27/13.66 [2019-03-28 12:00:10,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.27/13.66 [2019-03-28 12:00:10,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.27/13.66 [2019-03-28 12:00:10,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.27/13.66 [2019-03-28 12:00:10,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 24.27/13.66 [2019-03-28 12:00:10,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 24.27/13.66 [2019-03-28 12:00:10,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.27/13.66 [2019-03-28 12:00:10,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.27/13.66 [2019-03-28 12:00:10,672 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 24.27/13.66 [2019-03-28 12:00:10,672 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. 24.27/13.66 [2019-03-28 12:00:10,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.27/13.66 [2019-03-28 12:00:10,673 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 24.27/13.66 [2019-03-28 12:00:10,673 INFO L518 LassoAnalysis]: Proved termination. 24.27/13.66 [2019-03-28 12:00:10,673 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.27/13.66 Ranking function 2-nested ranking function: 24.27/13.66 f0 = 1*ULTIMATE.start_main_~x~0 24.27/13.66 f1 = 1*ULTIMATE.start_main_~y~0 24.27/13.66 Supporting invariants [] 24.27/13.66 [2019-03-28 12:00:10,674 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 24.27/13.66 [2019-03-28 12:00:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.27/13.66 [2019-03-28 12:00:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:10,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:10,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.27/13.66 [2019-03-28 12:00:10,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core 24.27/13.66 [2019-03-28 12:00:10,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.27/13.66 [2019-03-28 12:00:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.27/13.66 [2019-03-28 12:00:10,892 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization 24.27/13.66 [2019-03-28 12:00:10,892 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 12 loop predicates 24.27/13.66 [2019-03-28 12:00:10,892 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 15 Second operand 3 states. 24.27/13.66 [2019-03-28 12:00:11,330 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 128 states and 219 transitions. Complement of second has 46 states. 24.27/13.66 [2019-03-28 12:00:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states 24.27/13.66 [2019-03-28 12:00:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 24.27/13.66 [2019-03-28 12:00:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. 24.27/13.66 [2019-03-28 12:00:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. 24.27/13.66 [2019-03-28 12:00:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. 24.27/13.66 [2019-03-28 12:00:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:11,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 19 transitions. Stem has 4 letters. Loop has 4 letters. 24.27/13.66 [2019-03-28 12:00:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.27/13.66 [2019-03-28 12:00:11,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 219 transitions. 24.27/13.66 [2019-03-28 12:00:11,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.27/13.66 [2019-03-28 12:00:11,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 24.27/13.66 [2019-03-28 12:00:11,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 24.27/13.66 [2019-03-28 12:00:11,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,341 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 24.27/13.66 [2019-03-28 12:00:11,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 24.27/13.66 [2019-03-28 12:00:11,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.27/13.66 [2019-03-28 12:00:11,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 24.27/13.66 [2019-03-28 12:00:11,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:11 BasicIcfg 24.27/13.66 [2019-03-28 12:00:11,348 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 24.27/13.66 [2019-03-28 12:00:11,349 INFO L168 Benchmark]: Toolchain (without parser) took 9163.78 ms. Allocated memory was 649.6 MB in the beginning and 749.7 MB in the end (delta: 100.1 MB). Free memory was 558.5 MB in the beginning and 452.0 MB in the end (delta: 106.5 MB). Peak memory consumption was 206.7 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,351 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.08 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 558.5 MB in the beginning and 649.5 MB in the end (delta: -91.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 683.1 MB. Free memory was 649.5 MB in the beginning and 648.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,352 INFO L168 Benchmark]: Boogie Preprocessor took 20.10 ms. Allocated memory is still 683.1 MB. Free memory was 648.2 MB in the beginning and 645.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,353 INFO L168 Benchmark]: RCFGBuilder took 208.53 ms. Allocated memory is still 683.1 MB. Free memory was 645.1 MB in the beginning and 630.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,353 INFO L168 Benchmark]: BlockEncodingV2 took 82.43 ms. Allocated memory is still 683.1 MB. Free memory was 630.8 MB in the beginning and 625.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,354 INFO L168 Benchmark]: TraceAbstraction took 178.87 ms. Allocated memory is still 683.1 MB. Free memory was 625.4 MB in the beginning and 616.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,354 INFO L168 Benchmark]: BuchiAutomizer took 8337.66 ms. Allocated memory was 683.1 MB in the beginning and 749.7 MB in the end (delta: 66.6 MB). Free memory was 616.0 MB in the beginning and 452.0 MB in the end (delta: 164.0 MB). Peak memory consumption was 230.6 MB. Max. memory is 50.3 GB. 24.27/13.66 [2019-03-28 12:00:11,359 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 24.27/13.66 --- Results --- 24.27/13.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 24.27/13.66 - StatisticsResult: Initial Icfg 24.27/13.66 9 locations, 13 edges 24.27/13.66 - StatisticsResult: Encoded RCFG 24.27/13.66 3 locations, 4 edges 24.27/13.66 * Results from de.uni_freiburg.informatik.ultimate.core: 24.27/13.66 - StatisticsResult: Toolchain Benchmarks 24.27/13.66 Benchmark results are: 24.27/13.66 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.27/13.66 * CACSL2BoogieTranslator took 295.08 ms. Allocated memory was 649.6 MB in the beginning and 683.1 MB in the end (delta: 33.6 MB). Free memory was 558.5 MB in the beginning and 649.5 MB in the end (delta: -91.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 24.27/13.66 * Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 683.1 MB. Free memory was 649.5 MB in the beginning and 648.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.27/13.66 * Boogie Preprocessor took 20.10 ms. Allocated memory is still 683.1 MB. Free memory was 648.2 MB in the beginning and 645.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 24.27/13.66 * RCFGBuilder took 208.53 ms. Allocated memory is still 683.1 MB. Free memory was 645.1 MB in the beginning and 630.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 50.3 GB. 24.27/13.66 * BlockEncodingV2 took 82.43 ms. Allocated memory is still 683.1 MB. Free memory was 630.8 MB in the beginning and 625.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 24.27/13.66 * TraceAbstraction took 178.87 ms. Allocated memory is still 683.1 MB. Free memory was 625.4 MB in the beginning and 616.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 24.27/13.66 * BuchiAutomizer took 8337.66 ms. Allocated memory was 683.1 MB in the beginning and 749.7 MB in the end (delta: 66.6 MB). Free memory was 616.0 MB in the beginning and 452.0 MB in the end (delta: 164.0 MB). Peak memory consumption was 230.6 MB. Max. memory is 50.3 GB. 24.27/13.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 24.27/13.66 - AllSpecificationsHoldResult: All specifications hold 24.27/13.66 We were not able to verify any specifiation because the program does not contain any specification. 24.27/13.66 - InvariantResult [Line: 24]: Loop Invariant 24.27/13.66 Derived loop invariant: 1 24.27/13.66 - InvariantResult [Line: 22]: Loop Invariant 24.27/13.66 Derived loop invariant: 1 24.27/13.66 - StatisticsResult: Ultimate Automizer benchmark data 24.27/13.66 CFG has 1 procedures, 3 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=3occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 24.27/13.66 - StatisticsResult: Constructed decomposition of program 24.27/13.66 Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 10 locations. One nondeterministic module has affine ranking function -1 * y + z and consists of 2 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 10 locations. 24.27/13.66 - StatisticsResult: Timing statistics 24.27/13.66 BüchiAutomizer plugin needed 8.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 17 SDtfs, 41 SDslu, 0 SDs, 0 SdLazy, 103 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp91 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf93 smp100 dnf100 smp100 tf108 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.2s 24.27/13.66 - TerminationAnalysisResult: Termination proven 24.27/13.66 Buchi Automizer proved that your program is terminating 24.27/13.66 RESULT: Ultimate proved your program to be correct! 24.27/13.66 !SESSION 2019-03-28 11:59:58.923 ----------------------------------------------- 24.27/13.66 eclipse.buildId=unknown 24.27/13.66 java.version=1.8.0_181 24.27/13.66 java.vendor=Oracle Corporation 24.27/13.66 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 24.27/13.66 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 24.27/13.66 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 24.27/13.66 24.27/13.66 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:00:11.594 24.27/13.66 !MESSAGE The workspace will exit with unsaved changes in this session. 24.27/13.66 Received shutdown request... 24.27/13.66 Ultimate: 24.27/13.66 GTK+ Version Check 24.27/13.66 EOF