14.35/6.51 YES 14.35/6.51 14.35/6.52 Ultimate: Cannot open display: 14.35/6.52 This is Ultimate 0.1.24-8dc7c08-m 14.35/6.52 [2019-03-28 22:44:16,275 INFO L170 SettingsManager]: Resetting all preferences to default values... 14.35/6.52 [2019-03-28 22:44:16,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 14.35/6.52 [2019-03-28 22:44:16,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 14.35/6.52 [2019-03-28 22:44:16,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 14.35/6.52 [2019-03-28 22:44:16,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 14.35/6.52 [2019-03-28 22:44:16,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 14.35/6.52 [2019-03-28 22:44:16,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 14.35/6.52 [2019-03-28 22:44:16,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 14.35/6.52 [2019-03-28 22:44:16,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 14.35/6.52 [2019-03-28 22:44:16,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 14.35/6.52 [2019-03-28 22:44:16,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 14.35/6.52 [2019-03-28 22:44:16,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 14.35/6.52 [2019-03-28 22:44:16,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 14.35/6.52 [2019-03-28 22:44:16,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 14.35/6.52 [2019-03-28 22:44:16,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 14.35/6.52 [2019-03-28 22:44:16,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 14.35/6.52 [2019-03-28 22:44:16,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 14.35/6.52 [2019-03-28 22:44:16,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 14.35/6.52 [2019-03-28 22:44:16,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 14.35/6.52 [2019-03-28 22:44:16,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 14.35/6.52 [2019-03-28 22:44:16,310 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 14.35/6.52 [2019-03-28 22:44:16,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 14.35/6.52 [2019-03-28 22:44:16,311 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 14.35/6.52 [2019-03-28 22:44:16,312 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 14.35/6.52 [2019-03-28 22:44:16,313 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 14.35/6.52 [2019-03-28 22:44:16,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 14.35/6.52 [2019-03-28 22:44:16,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 14.35/6.52 [2019-03-28 22:44:16,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 14.35/6.52 [2019-03-28 22:44:16,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 14.35/6.52 [2019-03-28 22:44:16,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 14.35/6.52 [2019-03-28 22:44:16,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 14.35/6.52 [2019-03-28 22:44:16,318 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 14.35/6.52 [2019-03-28 22:44:16,332 INFO L110 SettingsManager]: Loading preferences was successful 14.35/6.52 [2019-03-28 22:44:16,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 14.35/6.52 [2019-03-28 22:44:16,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 14.35/6.52 [2019-03-28 22:44:16,333 INFO L133 SettingsManager]: * Rewrite not-equals=true 14.35/6.52 [2019-03-28 22:44:16,334 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 14.35/6.52 [2019-03-28 22:44:16,334 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 14.35/6.52 [2019-03-28 22:44:16,334 INFO L133 SettingsManager]: * Use SBE=true 14.35/6.52 [2019-03-28 22:44:16,334 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 14.35/6.52 [2019-03-28 22:44:16,334 INFO L133 SettingsManager]: * Use old map elimination=false 14.35/6.52 [2019-03-28 22:44:16,335 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 14.35/6.52 [2019-03-28 22:44:16,335 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 14.35/6.52 [2019-03-28 22:44:16,335 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 14.35/6.52 [2019-03-28 22:44:16,335 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 14.35/6.52 [2019-03-28 22:44:16,335 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 14.35/6.52 [2019-03-28 22:44:16,336 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:16,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 14.35/6.52 [2019-03-28 22:44:16,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 14.35/6.52 [2019-03-28 22:44:16,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE 14.35/6.52 [2019-03-28 22:44:16,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 14.35/6.52 [2019-03-28 22:44:16,337 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 14.35/6.52 [2019-03-28 22:44:16,337 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 14.35/6.52 [2019-03-28 22:44:16,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 14.35/6.52 [2019-03-28 22:44:16,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 14.35/6.52 [2019-03-28 22:44:16,337 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 14.35/6.52 [2019-03-28 22:44:16,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 14.35/6.52 [2019-03-28 22:44:16,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 14.35/6.52 [2019-03-28 22:44:16,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 14.35/6.52 [2019-03-28 22:44:16,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 14.35/6.52 [2019-03-28 22:44:16,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 14.35/6.52 [2019-03-28 22:44:16,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 14.35/6.52 [2019-03-28 22:44:16,377 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 14.35/6.52 [2019-03-28 22:44:16,381 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 14.35/6.52 [2019-03-28 22:44:16,382 INFO L271 PluginConnector]: Initializing CDTParser... 14.35/6.52 [2019-03-28 22:44:16,383 INFO L276 PluginConnector]: CDTParser initialized 14.35/6.52 [2019-03-28 22:44:16,384 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 14.35/6.52 [2019-03-28 22:44:16,441 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/3aee64b260ca45b3a79ffedaa473fede/FLAG4424d6a63 14.35/6.52 [2019-03-28 22:44:16,780 INFO L307 CDTParser]: Found 1 translation units. 14.35/6.52 [2019-03-28 22:44:16,781 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 14.35/6.52 [2019-03-28 22:44:16,917 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/3aee64b260ca45b3a79ffedaa473fede/FLAG4424d6a63 14.35/6.52 [2019-03-28 22:44:17,186 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/3aee64b260ca45b3a79ffedaa473fede 14.35/6.52 [2019-03-28 22:44:17,197 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 14.35/6.52 [2019-03-28 22:44:17,199 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 14.35/6.52 [2019-03-28 22:44:17,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 14.35/6.52 [2019-03-28 22:44:17,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 14.35/6.52 [2019-03-28 22:44:17,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 14.35/6.52 [2019-03-28 22:44:17,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4821685f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 14.35/6.52 [2019-03-28 22:44:17,233 INFO L176 MainTranslator]: Built tables and reachable declarations 14.35/6.52 [2019-03-28 22:44:17,394 INFO L206 PostProcessor]: Analyzing one entry point: main 14.35/6.52 [2019-03-28 22:44:17,398 INFO L191 MainTranslator]: Completed pre-run 14.35/6.52 [2019-03-28 22:44:17,414 INFO L206 PostProcessor]: Analyzing one entry point: main 14.35/6.52 [2019-03-28 22:44:17,428 INFO L195 MainTranslator]: Completed translation 14.35/6.52 [2019-03-28 22:44:17,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17 WrapperNode 14.35/6.52 [2019-03-28 22:44:17,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 14.35/6.52 [2019-03-28 22:44:17,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 14.35/6.52 [2019-03-28 22:44:17,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 14.35/6.52 [2019-03-28 22:44:17,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 14.35/6.52 [2019-03-28 22:44:17,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 14.35/6.52 [2019-03-28 22:44:17,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 14.35/6.52 [2019-03-28 22:44:17,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 14.35/6.52 [2019-03-28 22:44:17,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized 14.35/6.52 [2019-03-28 22:44:17,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 14.35/6.52 [2019-03-28 22:44:17,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 14.35/6.52 [2019-03-28 22:44:17,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... 14.35/6.52 [2019-03-28 22:44:17,536 INFO L276 PluginConnector]: RCFGBuilder initialized 14.35/6.52 [2019-03-28 22:44:17,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (1/1) ... 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 14.35/6.52 [2019-03-28 22:44:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 14.35/6.52 [2019-03-28 22:44:17,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 14.35/6.52 [2019-03-28 22:44:17,729 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 14.35/6.52 [2019-03-28 22:44:17,730 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 14.35/6.52 [2019-03-28 22:44:17,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:44:17 BoogieIcfgContainer 14.35/6.52 [2019-03-28 22:44:17,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 14.35/6.52 [2019-03-28 22:44:17,732 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 14.35/6.52 [2019-03-28 22:44:17,732 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 14.35/6.52 [2019-03-28 22:44:17,734 INFO L276 PluginConnector]: BlockEncodingV2 initialized 14.35/6.52 [2019-03-28 22:44:17,735 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:44:17" (1/1) ... 14.35/6.52 [2019-03-28 22:44:17,749 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 14.35/6.52 [2019-03-28 22:44:17,750 INFO L258 BlockEncoder]: Using Remove infeasible edges 14.35/6.52 [2019-03-28 22:44:17,751 INFO L263 BlockEncoder]: Using Maximize final states 14.35/6.52 [2019-03-28 22:44:17,752 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 14.35/6.52 [2019-03-28 22:44:17,752 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 14.35/6.52 [2019-03-28 22:44:17,754 INFO L296 BlockEncoder]: Using Remove sink states 14.35/6.52 [2019-03-28 22:44:17,755 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 14.35/6.52 [2019-03-28 22:44:17,755 INFO L179 BlockEncoder]: Using Rewrite not-equals 14.35/6.52 [2019-03-28 22:44:17,771 INFO L185 BlockEncoder]: Using Use SBE 14.35/6.52 [2019-03-28 22:44:17,785 INFO L200 BlockEncoder]: SBE split 2 edges 14.35/6.52 [2019-03-28 22:44:17,790 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 14.35/6.52 [2019-03-28 22:44:17,791 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.35/6.52 [2019-03-28 22:44:17,801 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 14.35/6.52 [2019-03-28 22:44:17,803 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 14.35/6.52 [2019-03-28 22:44:17,804 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 14.35/6.52 [2019-03-28 22:44:17,804 INFO L71 MaximizeFinalStates]: 0 new accepting states 14.35/6.52 [2019-03-28 22:44:17,805 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 14.35/6.52 [2019-03-28 22:44:17,805 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 14.35/6.52 [2019-03-28 22:44:17,806 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 14.35/6.52 [2019-03-28 22:44:17,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:44:17 BasicIcfg 14.35/6.52 [2019-03-28 22:44:17,806 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 14.35/6.52 [2019-03-28 22:44:17,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 14.35/6.52 [2019-03-28 22:44:17,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... 14.35/6.52 [2019-03-28 22:44:17,810 INFO L276 PluginConnector]: TraceAbstraction initialized 14.35/6.52 [2019-03-28 22:44:17,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:44:17" (1/4) ... 14.35/6.52 [2019-03-28 22:44:17,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283d9378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (2/4) ... 14.35/6.52 [2019-03-28 22:44:17,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283d9378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:44:17" (3/4) ... 14.35/6.52 [2019-03-28 22:44:17,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283d9378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:44:17" (4/4) ... 14.35/6.52 [2019-03-28 22:44:17,814 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 14.35/6.52 [2019-03-28 22:44:17,825 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 14.35/6.52 [2019-03-28 22:44:17,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 14.35/6.52 [2019-03-28 22:44:17,850 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 14.35/6.52 [2019-03-28 22:44:17,878 INFO L133 ementStrategyFactory]: Using default assertion order modulation 14.35/6.52 [2019-03-28 22:44:17,879 INFO L382 AbstractCegarLoop]: Interprodecural is true 14.35/6.52 [2019-03-28 22:44:17,879 INFO L383 AbstractCegarLoop]: Hoare is true 14.35/6.52 [2019-03-28 22:44:17,879 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 14.35/6.52 [2019-03-28 22:44:17,879 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 14.35/6.52 [2019-03-28 22:44:17,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 14.35/6.52 [2019-03-28 22:44:17,880 INFO L387 AbstractCegarLoop]: Difference is false 14.35/6.52 [2019-03-28 22:44:17,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 14.35/6.52 [2019-03-28 22:44:17,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 14.35/6.52 [2019-03-28 22:44:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 14.35/6.52 [2019-03-28 22:44:17,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 14.35/6.52 [2019-03-28 22:44:17,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 14.35/6.52 [2019-03-28 22:44:17,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 14.35/6.52 [2019-03-28 22:44:17,952 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. 14.35/6.52 [2019-03-28 22:44:17,952 INFO L451 ceAbstractionStarter]: At program point L21-2(lines 17 25) the Hoare annotation is: true 14.35/6.52 [2019-03-28 22:44:17,952 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. 14.35/6.52 [2019-03-28 22:44:17,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:44:17 BasicIcfg 14.35/6.52 [2019-03-28 22:44:17,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 14.35/6.52 [2019-03-28 22:44:17,961 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 14.35/6.52 [2019-03-28 22:44:17,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 14.35/6.52 [2019-03-28 22:44:17,965 INFO L276 PluginConnector]: BuchiAutomizer initialized 14.35/6.52 [2019-03-28 22:44:17,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.35/6.52 [2019-03-28 22:44:17,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:44:17" (1/5) ... 14.35/6.52 [2019-03-28 22:44:17,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aaefaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.35/6.52 [2019-03-28 22:44:17,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:44:17" (2/5) ... 14.35/6.52 [2019-03-28 22:44:17,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aaefaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.35/6.52 [2019-03-28 22:44:17,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:44:17" (3/5) ... 14.35/6.52 [2019-03-28 22:44:17,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aaefaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.35/6.52 [2019-03-28 22:44:17,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:44:17" (4/5) ... 14.35/6.52 [2019-03-28 22:44:17,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aaefaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:44:17, skipping insertion in model container 14.35/6.52 [2019-03-28 22:44:17,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 14.35/6.52 [2019-03-28 22:44:17,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:44:17" (5/5) ... 14.35/6.52 [2019-03-28 22:44:17,970 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 14.35/6.52 [2019-03-28 22:44:17,997 INFO L133 ementStrategyFactory]: Using default assertion order modulation 14.35/6.52 [2019-03-28 22:44:17,998 INFO L374 BuchiCegarLoop]: Interprodecural is true 14.35/6.52 [2019-03-28 22:44:17,998 INFO L375 BuchiCegarLoop]: Hoare is true 14.35/6.52 [2019-03-28 22:44:17,998 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 14.35/6.52 [2019-03-28 22:44:17,998 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 14.35/6.52 [2019-03-28 22:44:17,998 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 14.35/6.52 [2019-03-28 22:44:17,998 INFO L379 BuchiCegarLoop]: Difference is false 14.35/6.52 [2019-03-28 22:44:17,999 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 14.35/6.52 [2019-03-28 22:44:17,999 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 14.35/6.52 [2019-03-28 22:44:18,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 14.35/6.52 [2019-03-28 22:44:18,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.35/6.52 [2019-03-28 22:44:18,021 INFO L119 BuchiIsEmpty]: Starting construction of run 14.35/6.52 [2019-03-28 22:44:18,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.35/6.52 [2019-03-28 22:44:18,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 14.35/6.52 [2019-03-28 22:44:18,028 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 14.35/6.52 [2019-03-28 22:44:18,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 14.35/6.52 [2019-03-28 22:44:18,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.35/6.52 [2019-03-28 22:44:18,029 INFO L119 BuchiIsEmpty]: Starting construction of run 14.35/6.52 [2019-03-28 22:44:18,030 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.35/6.52 [2019-03-28 22:44:18,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 14.35/6.52 [2019-03-28 22:44:18,035 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [33] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#res] 6#L21-2true 14.35/6.52 [2019-03-28 22:44:18,035 INFO L796 eck$LassoCheckResult]: Loop: 6#L21-2true [48] L21-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 5#L18true [34] L18-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~q~0_11 v_ULTIMATE.start_main_~p~0_11) (= v_ULTIMATE.start_main_~q~0_10 (+ v_ULTIMATE.start_main_~q~0_11 (- 1)))) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_11, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_11} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_11, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~q~0] 6#L21-2true 14.35/6.52 [2019-03-28 22:44:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2483, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash 63026, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,200 INFO L216 LassoAnalysis]: Preferences: 14.35/6.52 [2019-03-28 22:44:18,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 14.35/6.52 [2019-03-28 22:44:18,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 14.35/6.52 [2019-03-28 22:44:18,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 14.35/6.52 [2019-03-28 22:44:18,202 INFO L127 ssoRankerPreferences]: Use exernal solver: true 14.35/6.52 [2019-03-28 22:44:18,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 14.35/6.52 [2019-03-28 22:44:18,203 INFO L130 ssoRankerPreferences]: Path of dumped script: 14.35/6.52 [2019-03-28 22:44:18,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 14.35/6.52 [2019-03-28 22:44:18,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 14.35/6.52 [2019-03-28 22:44:18,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 14.35/6.52 [2019-03-28 22:44:18,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,316 INFO L300 LassoAnalysis]: Preprocessing complete. 14.35/6.52 [2019-03-28 22:44:18,317 INFO L412 LassoAnalysis]: Checking for nontermination... 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:18,324 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:18,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. 14.35/6.52 [2019-03-28 22:44:18,358 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:18,364 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:18,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. 14.35/6.52 [2019-03-28 22:44:18,391 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:18,396 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:18,429 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:18,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 14.35/6.52 [2019-03-28 22:44:18,464 INFO L216 LassoAnalysis]: Preferences: 14.35/6.52 [2019-03-28 22:44:18,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 14.35/6.52 [2019-03-28 22:44:18,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 14.35/6.52 [2019-03-28 22:44:18,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 14.35/6.52 [2019-03-28 22:44:18,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false 14.35/6.52 [2019-03-28 22:44:18,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:18,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 14.35/6.52 [2019-03-28 22:44:18,465 INFO L130 ssoRankerPreferences]: Path of dumped script: 14.35/6.52 [2019-03-28 22:44:18,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 14.35/6.52 [2019-03-28 22:44:18,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 14.35/6.52 [2019-03-28 22:44:18,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 14.35/6.52 [2019-03-28 22:44:18,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:18,549 INFO L300 LassoAnalysis]: Preprocessing complete. 14.35/6.52 [2019-03-28 22:44:18,555 INFO L497 LassoAnalysis]: Using template 'affine'. 14.35/6.52 [2019-03-28 22:44:18,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:18,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:18,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:18,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:18,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:18,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:18,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:18,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 14.35/6.52 [2019-03-28 22:44:18,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:18,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:18,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:18,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:18,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:18,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:18,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:18,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 14.35/6.52 [2019-03-28 22:44:18,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:18,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:18,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 14.35/6.52 [2019-03-28 22:44:18,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:18,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:18,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:18,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:18,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:18,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 14.35/6.52 [2019-03-28 22:44:18,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 14.35/6.52 [2019-03-28 22:44:18,603 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 14.35/6.52 [2019-03-28 22:44:18,605 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 14.35/6.52 [2019-03-28 22:44:18,605 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 14.35/6.52 [2019-03-28 22:44:18,606 INFO L518 LassoAnalysis]: Proved termination. 14.35/6.52 [2019-03-28 22:44:18,606 INFO L520 LassoAnalysis]: Termination argument consisting of: 14.35/6.52 Ranking function f(ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~q~0 14.35/6.52 Supporting invariants [] 14.35/6.52 [2019-03-28 22:44:18,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 14.35/6.52 [2019-03-28 22:44:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:18,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 14.35/6.52 [2019-03-28 22:44:18,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... 14.35/6.52 [2019-03-28 22:44:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:18,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 14.35/6.52 [2019-03-28 22:44:18,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... 14.35/6.52 [2019-03-28 22:44:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.35/6.52 [2019-03-28 22:44:18,698 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 14.35/6.52 [2019-03-28 22:44:18,703 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 2 loop predicates 14.35/6.52 [2019-03-28 22:44:18,705 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 14.35/6.52 [2019-03-28 22:44:18,754 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 21 transitions. Complement of second has 4 states. 14.35/6.52 [2019-03-28 22:44:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 14.35/6.52 [2019-03-28 22:44:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 14.35/6.52 [2019-03-28 22:44:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. 14.35/6.52 [2019-03-28 22:44:18,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 2 letters. 14.35/6.52 [2019-03-28 22:44:18,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:18,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. 14.35/6.52 [2019-03-28 22:44:18,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:18,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 1 letters. Loop has 4 letters. 14.35/6.52 [2019-03-28 22:44:18,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:18,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 21 transitions. 14.35/6.52 [2019-03-28 22:44:18,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 21 transitions. 14.35/6.52 [2019-03-28 22:44:18,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 14.35/6.52 [2019-03-28 22:44:18,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 14.35/6.52 [2019-03-28 22:44:18,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 21 transitions. 14.35/6.52 [2019-03-28 22:44:18,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 14.35/6.52 [2019-03-28 22:44:18,776 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. 14.35/6.52 [2019-03-28 22:44:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 21 transitions. 14.35/6.52 [2019-03-28 22:44:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 14.35/6.52 [2019-03-28 22:44:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 14.35/6.52 [2019-03-28 22:44:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,821 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,821 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,821 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 14.35/6.52 [2019-03-28 22:44:18,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.35/6.52 [2019-03-28 22:44:18,823 INFO L119 BuchiIsEmpty]: Starting construction of run 14.35/6.52 [2019-03-28 22:44:18,823 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 14.35/6.52 [2019-03-28 22:44:18,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 14.35/6.52 [2019-03-28 22:44:18,824 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY [33] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#res] 52#L21-2 [47] L21-2-->L18: Formula: (and (> v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 53#L18 14.35/6.52 [2019-03-28 22:44:18,824 INFO L796 eck$LassoCheckResult]: Loop: 53#L18 [42] L18-->L21: Formula: (>= v_ULTIMATE.start_main_~q~0_12 v_ULTIMATE.start_main_~p~0_12) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} AuxVars[] AssignedVars[] 47#L21 [43] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~p~0_8 v_ULTIMATE.start_main_~q~0_7) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7} AuxVars[] AssignedVars[] 48#L21-2 [48] L21-2-->L18: Formula: (and (< 0 v_ULTIMATE.start_main_~p~0_10) (< v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 53#L18 14.35/6.52 [2019-03-28 22:44:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2031, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash 71534, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.35/6.52 [2019-03-28 22:44:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.35/6.52 [2019-03-28 22:44:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 14.35/6.52 [2019-03-28 22:44:18,874 INFO L811 eck$LassoCheckResult]: loop already infeasible 14.35/6.52 [2019-03-28 22:44:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.35/6.52 [2019-03-28 22:44:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.35/6.52 [2019-03-28 22:44:18,878 INFO L87 Difference]: Start difference. First operand 9 states and 20 transitions. cyclomatic complexity: 13 Second operand 3 states. 14.35/6.52 [2019-03-28 22:44:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.35/6.52 [2019-03-28 22:44:18,899 INFO L93 Difference]: Finished difference Result 11 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.35/6.52 [2019-03-28 22:44:18,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 20 transitions. 14.35/6.52 [2019-03-28 22:44:18,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 8 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 14.35/6.52 [2019-03-28 22:44:18,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 14.35/6.52 [2019-03-28 22:44:18,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 14.35/6.52 [2019-03-28 22:44:18,904 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. 14.35/6.52 [2019-03-28 22:44:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 14.35/6.52 [2019-03-28 22:44:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. 14.35/6.52 [2019-03-28 22:44:18,906 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 14.35/6.52 [2019-03-28 22:44:18,906 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. 14.35/6.52 [2019-03-28 22:44:18,906 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 14.35/6.52 [2019-03-28 22:44:18,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. 14.35/6.52 [2019-03-28 22:44:18,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.35/6.52 [2019-03-28 22:44:18,907 INFO L119 BuchiIsEmpty]: Starting construction of run 14.35/6.52 [2019-03-28 22:44:18,907 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 14.35/6.52 [2019-03-28 22:44:18,907 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 14.35/6.52 [2019-03-28 22:44:18,908 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY [33] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#res] 76#L21-2 [47] L21-2-->L18: Formula: (and (> v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 77#L18 14.35/6.52 [2019-03-28 22:44:18,908 INFO L796 eck$LassoCheckResult]: Loop: 77#L18 [42] L18-->L21: Formula: (>= v_ULTIMATE.start_main_~q~0_12 v_ULTIMATE.start_main_~p~0_12) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} AuxVars[] AssignedVars[] 73#L21 [43] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~p~0_8 v_ULTIMATE.start_main_~q~0_7) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_8, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_7} AuxVars[] AssignedVars[] 74#L21-2 [47] L21-2-->L18: Formula: (and (> v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 77#L18 14.35/6.52 [2019-03-28 22:44:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2031, now seen corresponding path program 2 times 14.35/6.52 [2019-03-28 22:44:18,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash 71533, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.35/6.52 [2019-03-28 22:44:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 14.35/6.52 [2019-03-28 22:44:18,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 14.35/6.52 [2019-03-28 22:44:18,932 INFO L811 eck$LassoCheckResult]: loop already infeasible 14.35/6.52 [2019-03-28 22:44:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 14.35/6.52 [2019-03-28 22:44:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 14.35/6.52 [2019-03-28 22:44:18,933 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. cyclomatic complexity: 7 Second operand 3 states. 14.35/6.52 [2019-03-28 22:44:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 14.35/6.52 [2019-03-28 22:44:18,954 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 14.35/6.52 [2019-03-28 22:44:18,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. 14.35/6.52 [2019-03-28 22:44:18,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 5 states and 5 transitions. 14.35/6.52 [2019-03-28 22:44:18,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 14.35/6.52 [2019-03-28 22:44:18,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 14.35/6.52 [2019-03-28 22:44:18,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. 14.35/6.52 [2019-03-28 22:44:18,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.35/6.52 [2019-03-28 22:44:18,958 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 14.35/6.52 [2019-03-28 22:44:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. 14.35/6.52 [2019-03-28 22:44:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 4. 14.35/6.52 [2019-03-28 22:44:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 14.35/6.52 [2019-03-28 22:44:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. 14.35/6.52 [2019-03-28 22:44:18,959 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 4 transitions. 14.35/6.52 [2019-03-28 22:44:18,960 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 4 transitions. 14.35/6.52 [2019-03-28 22:44:18,960 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 14.35/6.52 [2019-03-28 22:44:18,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 4 transitions. 14.35/6.52 [2019-03-28 22:44:18,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 14.35/6.52 [2019-03-28 22:44:18,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 14.35/6.52 [2019-03-28 22:44:18,960 INFO L119 BuchiIsEmpty]: Starting construction of run 14.35/6.52 [2019-03-28 22:44:18,961 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 14.35/6.52 [2019-03-28 22:44:18,961 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 14.35/6.52 [2019-03-28 22:44:18,961 INFO L794 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY [33] ULTIMATE.startENTRY-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~q~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_1, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~p~0, ULTIMATE.start_main_~q~0, ULTIMATE.start_main_#res] 97#L21-2 14.35/6.52 [2019-03-28 22:44:18,961 INFO L796 eck$LassoCheckResult]: Loop: 97#L21-2 [47] L21-2-->L18: Formula: (and (> v_ULTIMATE.start_main_~q~0_9 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~p~0_10) (< 0 v_ULTIMATE.start_main_~q~0_9)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_10, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_9} AuxVars[] AssignedVars[] 99#L18 [42] L18-->L21: Formula: (>= v_ULTIMATE.start_main_~q~0_12 v_ULTIMATE.start_main_~p~0_12) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_12, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_12} AuxVars[] AssignedVars[] 96#L21 [31] L21-->L21-2: Formula: (and (= v_ULTIMATE.start_main_~p~0_6 (+ v_ULTIMATE.start_main_~p~0_7 (- 1))) (< v_ULTIMATE.start_main_~p~0_7 v_ULTIMATE.start_main_~q~0_6)) InVars {ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_7, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_6} OutVars{ULTIMATE.start_main_~p~0=v_ULTIMATE.start_main_~p~0_6, ULTIMATE.start_main_~q~0=v_ULTIMATE.start_main_~q~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~p~0] 97#L21-2 14.35/6.52 [2019-03-28 22:44:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times 14.35/6.52 [2019-03-28 22:44:18,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 76291, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1953124, now seen corresponding path program 1 times 14.35/6.52 [2019-03-28 22:44:18,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 14.35/6.52 [2019-03-28 22:44:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 14.35/6.52 [2019-03-28 22:44:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 14.35/6.52 [2019-03-28 22:44:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 14.35/6.52 [2019-03-28 22:44:19,011 INFO L216 LassoAnalysis]: Preferences: 14.35/6.52 [2019-03-28 22:44:19,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 14.35/6.52 [2019-03-28 22:44:19,011 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 14.35/6.52 [2019-03-28 22:44:19,011 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 14.35/6.52 [2019-03-28 22:44:19,012 INFO L127 ssoRankerPreferences]: Use exernal solver: true 14.35/6.52 [2019-03-28 22:44:19,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 14.35/6.52 [2019-03-28 22:44:19,012 INFO L130 ssoRankerPreferences]: Path of dumped script: 14.35/6.52 [2019-03-28 22:44:19,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 14.35/6.52 [2019-03-28 22:44:19,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 14.35/6.52 [2019-03-28 22:44:19,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 14.35/6.52 [2019-03-28 22:44:19,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,079 INFO L300 LassoAnalysis]: Preprocessing complete. 14.35/6.52 [2019-03-28 22:44:19,079 INFO L412 LassoAnalysis]: Checking for nontermination... 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:19,087 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:19,116 INFO L445 LassoAnalysis]: Proved nontermination for one component. 14.35/6.52 [2019-03-28 22:44:19,117 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:19,123 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:19,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. 14.35/6.52 [2019-03-28 22:44:19,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:19,157 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 14.35/6.52 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 14.35/6.52 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 14.35/6.52 [2019-03-28 22:44:19,189 INFO L163 nArgumentSynthesizer]: Using integer mode. 14.35/6.52 [2019-03-28 22:44:19,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 14.35/6.52 [2019-03-28 22:44:19,225 INFO L216 LassoAnalysis]: Preferences: 14.35/6.52 [2019-03-28 22:44:19,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 14.35/6.52 [2019-03-28 22:44:19,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 14.35/6.52 [2019-03-28 22:44:19,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 14.35/6.52 [2019-03-28 22:44:19,226 INFO L127 ssoRankerPreferences]: Use exernal solver: false 14.35/6.52 [2019-03-28 22:44:19,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 14.35/6.52 [2019-03-28 22:44:19,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 14.35/6.52 [2019-03-28 22:44:19,226 INFO L130 ssoRankerPreferences]: Path of dumped script: 14.35/6.52 [2019-03-28 22:44:19,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 14.35/6.52 [2019-03-28 22:44:19,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 14.35/6.52 [2019-03-28 22:44:19,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 14.35/6.52 [2019-03-28 22:44:19,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 14.35/6.52 [2019-03-28 22:44:19,300 INFO L300 LassoAnalysis]: Preprocessing complete. 14.35/6.52 [2019-03-28 22:44:19,300 INFO L497 LassoAnalysis]: Using template 'affine'. 14.35/6.52 [2019-03-28 22:44:19,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:19,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:19,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:19,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:19,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:19,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:19,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:19,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 14.35/6.52 [2019-03-28 22:44:19,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:19,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:19,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:19,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:19,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:19,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:19,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:19,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 14.35/6.52 [2019-03-28 22:44:19,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 14.35/6.52 Termination analysis: LINEAR_WITH_GUESSES 14.35/6.52 Number of strict supporting invariants: 0 14.35/6.52 Number of non-strict supporting invariants: 1 14.35/6.52 Consider only non-deceasing supporting invariants: true 14.35/6.52 Simplify termination arguments: true 14.35/6.52 Simplify supporting invariants: trueOverapproximate stem: false 14.35/6.52 [2019-03-28 22:44:19,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. 14.35/6.52 [2019-03-28 22:44:19,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 14.35/6.52 [2019-03-28 22:44:19,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 14.35/6.52 [2019-03-28 22:44:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 14.35/6.52 [2019-03-28 22:44:19,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 14.35/6.52 [2019-03-28 22:44:19,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 14.35/6.52 [2019-03-28 22:44:19,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 14.35/6.52 [2019-03-28 22:44:19,324 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 14.35/6.52 [2019-03-28 22:44:19,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 14.35/6.52 [2019-03-28 22:44:19,328 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 14.35/6.52 [2019-03-28 22:44:19,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 14.35/6.52 [2019-03-28 22:44:19,329 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 14.35/6.52 [2019-03-28 22:44:19,329 INFO L518 LassoAnalysis]: Proved termination. 14.35/6.52 [2019-03-28 22:44:19,329 INFO L520 LassoAnalysis]: Termination argument consisting of: 14.35/6.52 Ranking function f(ULTIMATE.start_main_~p~0) = 1*ULTIMATE.start_main_~p~0 14.35/6.52 Supporting invariants [] 14.35/6.52 [2019-03-28 22:44:19,329 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 14.35/6.52 [2019-03-28 22:44:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 14.35/6.52 [2019-03-28 22:44:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:19,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 14.35/6.52 [2019-03-28 22:44:19,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... 14.35/6.52 [2019-03-28 22:44:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:19,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 14.35/6.52 [2019-03-28 22:44:19,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... 14.35/6.52 [2019-03-28 22:44:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 14.35/6.52 [2019-03-28 22:44:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 14.35/6.52 [2019-03-28 22:44:19,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 14.35/6.52 [2019-03-28 22:44:19,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... 14.35/6.52 [2019-03-28 22:44:19,428 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 14.35/6.52 [2019-03-28 22:44:19,428 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 14.35/6.52 [2019-03-28 22:44:19,428 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states and 4 transitions. cyclomatic complexity: 1 Second operand 3 states. 14.35/6.52 [2019-03-28 22:44:19,443 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states and 4 transitions. cyclomatic complexity: 1. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 4 states. 14.35/6.52 [2019-03-28 22:44:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 14.35/6.52 [2019-03-28 22:44:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 14.35/6.52 [2019-03-28 22:44:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. 14.35/6.52 [2019-03-28 22:44:19,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 3 letters. 14.35/6.52 [2019-03-28 22:44:19,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:19,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 3 letters. 14.35/6.52 [2019-03-28 22:44:19,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:19,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 1 letters. Loop has 6 letters. 14.35/6.52 [2019-03-28 22:44:19,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. 14.35/6.52 [2019-03-28 22:44:19,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. 14.35/6.52 [2019-03-28 22:44:19,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 14.35/6.52 [2019-03-28 22:44:19,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 14.35/6.52 [2019-03-28 22:44:19,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 14.35/6.52 [2019-03-28 22:44:19,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 14.35/6.52 [2019-03-28 22:44:19,449 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,449 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,449 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,449 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 14.35/6.52 [2019-03-28 22:44:19,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 14.35/6.52 [2019-03-28 22:44:19,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 14.35/6.52 [2019-03-28 22:44:19,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 14.35/6.52 [2019-03-28 22:44:19,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:44:19 BasicIcfg 14.35/6.52 [2019-03-28 22:44:19,456 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 14.35/6.52 [2019-03-28 22:44:19,457 INFO L168 Benchmark]: Toolchain (without parser) took 2258.84 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 559.4 MB in the beginning and 454.0 MB in the end (delta: 105.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,459 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.98 ms. Allocated memory is still 649.6 MB. Free memory was 559.4 MB in the beginning and 549.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.79 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 549.6 MB in the beginning and 646.1 MB in the end (delta: -96.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,461 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 ms. Allocated memory is still 682.1 MB. Free memory was 646.1 MB in the beginning and 645.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,461 INFO L168 Benchmark]: RCFGBuilder took 195.38 ms. Allocated memory is still 682.1 MB. Free memory was 645.0 MB in the beginning and 631.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,462 INFO L168 Benchmark]: BlockEncodingV2 took 74.39 ms. Allocated memory is still 682.1 MB. Free memory was 631.6 MB in the beginning and 627.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,462 INFO L168 Benchmark]: TraceAbstraction took 153.72 ms. Allocated memory is still 682.1 MB. Free memory was 626.2 MB in the beginning and 617.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,463 INFO L168 Benchmark]: BuchiAutomizer took 1495.03 ms. Allocated memory is still 682.1 MB. Free memory was 617.5 MB in the beginning and 454.0 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 50.3 GB. 14.35/6.52 [2019-03-28 22:44:19,467 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 14.35/6.52 --- Results --- 14.35/6.52 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 14.35/6.52 - StatisticsResult: Initial Icfg 14.35/6.52 8 locations, 11 edges 14.35/6.52 - StatisticsResult: Encoded RCFG 14.35/6.52 4 locations, 7 edges 14.35/6.52 * Results from de.uni_freiburg.informatik.ultimate.core: 14.35/6.52 - StatisticsResult: Toolchain Benchmarks 14.35/6.52 Benchmark results are: 14.35/6.52 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 14.35/6.52 * CACSL2BoogieTranslator took 228.98 ms. Allocated memory is still 649.6 MB. Free memory was 559.4 MB in the beginning and 549.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 14.35/6.52 * Boogie Procedure Inliner took 86.79 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 549.6 MB in the beginning and 646.1 MB in the end (delta: -96.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 14.35/6.52 * Boogie Preprocessor took 19.22 ms. Allocated memory is still 682.1 MB. Free memory was 646.1 MB in the beginning and 645.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 14.35/6.52 * RCFGBuilder took 195.38 ms. Allocated memory is still 682.1 MB. Free memory was 645.0 MB in the beginning and 631.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 14.35/6.52 * BlockEncodingV2 took 74.39 ms. Allocated memory is still 682.1 MB. Free memory was 631.6 MB in the beginning and 627.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. 14.35/6.52 * TraceAbstraction took 153.72 ms. Allocated memory is still 682.1 MB. Free memory was 626.2 MB in the beginning and 617.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 14.35/6.52 * BuchiAutomizer took 1495.03 ms. Allocated memory is still 682.1 MB. Free memory was 617.5 MB in the beginning and 454.0 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 50.3 GB. 14.35/6.52 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 14.35/6.52 - AllSpecificationsHoldResult: All specifications hold 14.35/6.52 We were not able to verify any specifiation because the program does not contain any specification. 14.35/6.52 - InvariantResult [Line: 17]: Loop Invariant 14.35/6.52 Derived loop invariant: 1 14.35/6.52 - StatisticsResult: Ultimate Automizer benchmark data 14.35/6.52 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s 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=4occurred 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 14.35/6.52 - StatisticsResult: Constructed decomposition of program 14.35/6.52 Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function q and consists of 3 locations. One nondeterministic module has affine ranking function p and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 14.35/6.52 - StatisticsResult: Timing statistics 14.35/6.52 BüchiAutomizer plugin needed 1.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 23 SDslu, 0 SDs, 0 SdLazy, 52 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax192 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s 14.35/6.52 - TerminationAnalysisResult: Termination proven 14.35/6.52 Buchi Automizer proved that your program is terminating 14.35/6.52 RESULT: Ultimate proved your program to be correct! 14.35/6.52 !SESSION 2019-03-28 22:44:13.995 ----------------------------------------------- 14.35/6.52 eclipse.buildId=unknown 14.35/6.52 java.version=1.8.0_181 14.35/6.52 java.vendor=Oracle Corporation 14.35/6.52 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 14.35/6.52 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 14.35/6.52 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 14.35/6.52 14.35/6.52 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:44:19.701 14.35/6.52 !MESSAGE The workspace will exit with unsaved changes in this session. 14.35/6.52 Received shutdown request... 14.35/6.52 Ultimate: 14.35/6.52 GTK+ Version Check 14.35/6.52 EOF