20.11/11.62 YES 20.11/11.62 20.11/11.62 Ultimate: Cannot open display: 20.11/11.62 This is Ultimate 0.1.24-8dc7c08-m 20.11/11.62 [2019-03-28 11:53:05,503 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.11/11.62 [2019-03-28 11:53:05,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.11/11.62 [2019-03-28 11:53:05,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.11/11.62 [2019-03-28 11:53:05,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.11/11.62 [2019-03-28 11:53:05,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.11/11.62 [2019-03-28 11:53:05,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.11/11.62 [2019-03-28 11:53:05,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.11/11.62 [2019-03-28 11:53:05,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.11/11.62 [2019-03-28 11:53:05,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.11/11.62 [2019-03-28 11:53:05,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.11/11.62 [2019-03-28 11:53:05,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.11/11.62 [2019-03-28 11:53:05,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.11/11.62 [2019-03-28 11:53:05,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.11/11.62 [2019-03-28 11:53:05,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.11/11.62 [2019-03-28 11:53:05,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.11/11.62 [2019-03-28 11:53:05,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.11/11.62 [2019-03-28 11:53:05,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.11/11.62 [2019-03-28 11:53:05,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.11/11.62 [2019-03-28 11:53:05,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.11/11.62 [2019-03-28 11:53:05,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,540 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.11/11.62 [2019-03-28 11:53:05,540 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.11/11.62 [2019-03-28 11:53:05,541 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.11/11.62 [2019-03-28 11:53:05,542 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.11/11.62 [2019-03-28 11:53:05,543 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.11/11.62 [2019-03-28 11:53:05,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.11/11.62 [2019-03-28 11:53:05,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.11/11.62 [2019-03-28 11:53:05,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.11/11.62 [2019-03-28 11:53:05,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.11/11.62 [2019-03-28 11:53:05,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.11/11.62 [2019-03-28 11:53:05,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.11/11.62 [2019-03-28 11:53:05,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.11/11.62 [2019-03-28 11:53:05,548 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 20.11/11.62 [2019-03-28 11:53:05,563 INFO L110 SettingsManager]: Loading preferences was successful 20.11/11.62 [2019-03-28 11:53:05,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.11/11.62 [2019-03-28 11:53:05,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.11/11.62 [2019-03-28 11:53:05,565 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.11/11.62 [2019-03-28 11:53:05,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.11/11.62 [2019-03-28 11:53:05,565 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.11/11.62 [2019-03-28 11:53:05,565 INFO L133 SettingsManager]: * Use SBE=true 20.11/11.62 [2019-03-28 11:53:05,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Use old map elimination=false 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.11/11.62 [2019-03-28 11:53:05,566 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.11/11.62 [2019-03-28 11:53:05,567 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.62 [2019-03-28 11:53:05,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.11/11.62 [2019-03-28 11:53:05,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.11/11.62 [2019-03-28 11:53:05,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.11/11.62 [2019-03-28 11:53:05,567 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.11/11.62 [2019-03-28 11:53:05,568 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.11/11.62 [2019-03-28 11:53:05,568 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.11/11.62 [2019-03-28 11:53:05,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.11/11.62 [2019-03-28 11:53:05,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.11/11.62 [2019-03-28 11:53:05,568 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.11/11.62 [2019-03-28 11:53:05,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.11/11.62 [2019-03-28 11:53:05,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.11/11.62 [2019-03-28 11:53:05,569 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.11/11.62 [2019-03-28 11:53:05,569 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.11/11.62 [2019-03-28 11:53:05,569 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.11/11.62 [2019-03-28 11:53:05,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.11/11.62 [2019-03-28 11:53:05,628 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.11/11.62 [2019-03-28 11:53:05,632 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.11/11.62 [2019-03-28 11:53:05,634 INFO L271 PluginConnector]: Initializing CDTParser... 20.11/11.62 [2019-03-28 11:53:05,634 INFO L276 PluginConnector]: CDTParser initialized 20.11/11.62 [2019-03-28 11:53:05,635 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 20.11/11.62 [2019-03-28 11:53:05,754 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/009683444f6d4de883b5e6bf0097c741/FLAG330712a12 20.11/11.62 [2019-03-28 11:53:06,278 INFO L307 CDTParser]: Found 1 translation units. 20.11/11.62 [2019-03-28 11:53:06,279 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 20.11/11.62 [2019-03-28 11:53:06,286 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/009683444f6d4de883b5e6bf0097c741/FLAG330712a12 20.11/11.62 [2019-03-28 11:53:06,686 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/009683444f6d4de883b5e6bf0097c741 20.11/11.62 [2019-03-28 11:53:06,698 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.11/11.62 [2019-03-28 11:53:06,700 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.11/11.62 [2019-03-28 11:53:06,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.11/11.62 [2019-03-28 11:53:06,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.11/11.62 [2019-03-28 11:53:06,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.11/11.62 [2019-03-28 11:53:06,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:06,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72209e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:06,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:06,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.11/11.62 [2019-03-28 11:53:06,734 INFO L176 MainTranslator]: Built tables and reachable declarations 20.11/11.62 [2019-03-28 11:53:06,891 INFO L206 PostProcessor]: Analyzing one entry point: main 20.11/11.62 [2019-03-28 11:53:06,895 INFO L191 MainTranslator]: Completed pre-run 20.11/11.62 [2019-03-28 11:53:06,911 INFO L206 PostProcessor]: Analyzing one entry point: main 20.11/11.62 [2019-03-28 11:53:06,925 INFO L195 MainTranslator]: Completed translation 20.11/11.62 [2019-03-28 11:53:06,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06 WrapperNode 20.11/11.62 [2019-03-28 11:53:06,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.11/11.62 [2019-03-28 11:53:06,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.11/11.62 [2019-03-28 11:53:06,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.11/11.62 [2019-03-28 11:53:06,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.11/11.62 [2019-03-28 11:53:06,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:06,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.11/11.62 [2019-03-28 11:53:07,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.11/11.62 [2019-03-28 11:53:07,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.11/11.62 [2019-03-28 11:53:07,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.11/11.62 [2019-03-28 11:53:07,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.11/11.62 [2019-03-28 11:53:07,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.11/11.62 [2019-03-28 11:53:07,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.11/11.62 [2019-03-28 11:53:07,044 INFO L276 PluginConnector]: RCFGBuilder initialized 20.11/11.62 [2019-03-28 11:53:07,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 20.11/11.62 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.62 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.11/11.62 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.11/11.62 [2019-03-28 11:53:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.11/11.62 [2019-03-28 11:53:07,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.11/11.62 [2019-03-28 11:53:07,252 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.11/11.62 [2019-03-28 11:53:07,252 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.11/11.62 [2019-03-28 11:53:07,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:07 BoogieIcfgContainer 20.11/11.62 [2019-03-28 11:53:07,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.11/11.62 [2019-03-28 11:53:07,254 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.11/11.62 [2019-03-28 11:53:07,254 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.11/11.62 [2019-03-28 11:53:07,256 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.11/11.62 [2019-03-28 11:53:07,257 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:07" (1/1) ... 20.11/11.62 [2019-03-28 11:53:07,272 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 20.11/11.62 [2019-03-28 11:53:07,273 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.11/11.62 [2019-03-28 11:53:07,274 INFO L263 BlockEncoder]: Using Maximize final states 20.11/11.62 [2019-03-28 11:53:07,275 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.11/11.62 [2019-03-28 11:53:07,275 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.11/11.62 [2019-03-28 11:53:07,277 INFO L296 BlockEncoder]: Using Remove sink states 20.11/11.62 [2019-03-28 11:53:07,278 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.11/11.62 [2019-03-28 11:53:07,278 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.11/11.62 [2019-03-28 11:53:07,293 INFO L185 BlockEncoder]: Using Use SBE 20.11/11.62 [2019-03-28 11:53:07,310 INFO L200 BlockEncoder]: SBE split 3 edges 20.11/11.62 [2019-03-28 11:53:07,314 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.11/11.62 [2019-03-28 11:53:07,316 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.11/11.62 [2019-03-28 11:53:07,326 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 20.11/11.62 [2019-03-28 11:53:07,328 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 20.11/11.62 [2019-03-28 11:53:07,330 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.11/11.62 [2019-03-28 11:53:07,330 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.11/11.62 [2019-03-28 11:53:07,335 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 20.11/11.62 [2019-03-28 11:53:07,336 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.11/11.62 [2019-03-28 11:53:07,336 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.11/11.62 [2019-03-28 11:53:07,336 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.11/11.62 [2019-03-28 11:53:07,336 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.11/11.62 [2019-03-28 11:53:07,337 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.11/11.62 [2019-03-28 11:53:07,337 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 7 edges 20.11/11.62 [2019-03-28 11:53:07,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:07 BasicIcfg 20.11/11.62 [2019-03-28 11:53:07,338 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.11/11.62 [2019-03-28 11:53:07,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.11/11.62 [2019-03-28 11:53:07,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.11/11.62 [2019-03-28 11:53:07,342 INFO L276 PluginConnector]: TraceAbstraction initialized 20.11/11.62 [2019-03-28 11:53:07,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:53:06" (1/4) ... 20.11/11.62 [2019-03-28 11:53:07,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd35ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (2/4) ... 20.11/11.62 [2019-03-28 11:53:07,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd35ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:07" (3/4) ... 20.11/11.62 [2019-03-28 11:53:07,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd35ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:07" (4/4) ... 20.11/11.62 [2019-03-28 11:53:07,346 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.11/11.62 [2019-03-28 11:53:07,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.11/11.62 [2019-03-28 11:53:07,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 20.11/11.62 [2019-03-28 11:53:07,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 20.11/11.62 [2019-03-28 11:53:07,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.11/11.62 [2019-03-28 11:53:07,409 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.11/11.62 [2019-03-28 11:53:07,409 INFO L383 AbstractCegarLoop]: Hoare is true 20.11/11.62 [2019-03-28 11:53:07,409 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.11/11.62 [2019-03-28 11:53:07,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.11/11.62 [2019-03-28 11:53:07,410 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.11/11.62 [2019-03-28 11:53:07,410 INFO L387 AbstractCegarLoop]: Difference is false 20.11/11.62 [2019-03-28 11:53:07,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.11/11.62 [2019-03-28 11:53:07,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.11/11.62 [2019-03-28 11:53:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 20.11/11.62 [2019-03-28 11:53:07,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.11/11.62 [2019-03-28 11:53:07,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 20.11/11.62 [2019-03-28 11:53:07,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.11/11.62 [2019-03-28 11:53:07,482 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 26) no Hoare annotation was computed. 20.11/11.62 [2019-03-28 11:53:07,482 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 21 27) the Hoare annotation is: true 20.11/11.62 [2019-03-28 11:53:07,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:07 BasicIcfg 20.11/11.62 [2019-03-28 11:53:07,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.11/11.62 [2019-03-28 11:53:07,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.11/11.62 [2019-03-28 11:53:07,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.11/11.62 [2019-03-28 11:53:07,494 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.11/11.62 [2019-03-28 11:53:07,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.11/11.62 [2019-03-28 11:53:07,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:53:06" (1/5) ... 20.11/11.62 [2019-03-28 11:53:07,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22a9f552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.11/11.62 [2019-03-28 11:53:07,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (2/5) ... 20.11/11.62 [2019-03-28 11:53:07,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22a9f552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.11/11.62 [2019-03-28 11:53:07,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:07" (3/5) ... 20.11/11.62 [2019-03-28 11:53:07,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22a9f552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.11/11.62 [2019-03-28 11:53:07,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:07" (4/5) ... 20.11/11.62 [2019-03-28 11:53:07,498 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22a9f552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:07, skipping insertion in model container 20.11/11.62 [2019-03-28 11:53:07,498 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.11/11.62 [2019-03-28 11:53:07,498 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:07" (5/5) ... 20.11/11.62 [2019-03-28 11:53:07,500 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.11/11.62 [2019-03-28 11:53:07,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.11/11.62 [2019-03-28 11:53:07,530 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.11/11.62 [2019-03-28 11:53:07,530 INFO L375 BuchiCegarLoop]: Hoare is true 20.11/11.62 [2019-03-28 11:53:07,530 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.11/11.62 [2019-03-28 11:53:07,530 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.11/11.62 [2019-03-28 11:53:07,530 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.11/11.62 [2019-03-28 11:53:07,530 INFO L379 BuchiCegarLoop]: Difference is false 20.11/11.62 [2019-03-28 11:53:07,530 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.11/11.62 [2019-03-28 11:53:07,531 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.11/11.62 [2019-03-28 11:53:07,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 20.11/11.62 [2019-03-28 11:53:07,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.11/11.62 [2019-03-28 11:53:07,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.62 [2019-03-28 11:53:07,553 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.62 [2019-03-28 11:53:07,559 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.11/11.62 [2019-03-28 11:53:07,560 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.62 [2019-03-28 11:53:07,560 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.11/11.62 [2019-03-28 11:53:07,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 20.11/11.62 [2019-03-28 11:53:07,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.11/11.62 [2019-03-28 11:53:07,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.62 [2019-03-28 11:53:07,561 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.62 [2019-03-28 11:53:07,561 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 20.11/11.62 [2019-03-28 11:53:07,561 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.62 [2019-03-28 11:53:07,566 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 5#L22-2true 20.11/11.62 [2019-03-28 11:53:07,567 INFO L796 eck$LassoCheckResult]: Loop: 5#L22-2true [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 4#L22true [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 5#L22-2true 20.11/11.62 [2019-03-28 11:53:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.62 [2019-03-28 11:53:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times 20.11/11.62 [2019-03-28 11:53:07,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.62 [2019-03-28 11:53:07,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.62 [2019-03-28 11:53:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.62 [2019-03-28 11:53:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2481, now seen corresponding path program 1 times 20.11/11.62 [2019-03-28 11:53:07,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.62 [2019-03-28 11:53:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.62 [2019-03-28 11:53:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.62 [2019-03-28 11:53:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 83205, now seen corresponding path program 1 times 20.11/11.62 [2019-03-28 11:53:07,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.62 [2019-03-28 11:53:07,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.62 [2019-03-28 11:53:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.62 [2019-03-28 11:53:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.62 [2019-03-28 11:53:07,726 INFO L216 LassoAnalysis]: Preferences: 20.11/11.62 [2019-03-28 11:53:07,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.62 [2019-03-28 11:53:07,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.62 [2019-03-28 11:53:07,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.62 [2019-03-28 11:53:07,728 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.11/11.62 [2019-03-28 11:53:07,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.62 [2019-03-28 11:53:07,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.62 [2019-03-28 11:53:07,728 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.62 [2019-03-28 11:53:07,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.11/11.62 [2019-03-28 11:53:07,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.62 [2019-03-28 11:53:07,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.62 [2019-03-28 11:53:07,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.62 [2019-03-28 11:53:07,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.62 [2019-03-28 11:53:07,812 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.62 [2019-03-28 11:53:07,812 INFO L412 LassoAnalysis]: Checking for nontermination... 20.11/11.62 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.62 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.62 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.62 [2019-03-28 11:53:07,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.62 [2019-03-28 11:53:07,820 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.62 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.62 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.62 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.62 [2019-03-28 11:53:07,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.11/11.62 [2019-03-28 11:53:07,853 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.62 [2019-03-28 11:53:08,082 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.11/11.62 [2019-03-28 11:53:08,085 INFO L216 LassoAnalysis]: Preferences: 20.11/11.62 [2019-03-28 11:53:08,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.62 [2019-03-28 11:53:08,085 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.62 [2019-03-28 11:53:08,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.62 [2019-03-28 11:53:08,085 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.11/11.62 [2019-03-28 11:53:08,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.11/11.62 [2019-03-28 11:53:08,085 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.62 [2019-03-28 11:53:08,086 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.62 [2019-03-28 11:53:08,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 20.11/11.62 [2019-03-28 11:53:08,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.62 [2019-03-28 11:53:08,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.62 [2019-03-28 11:53:08,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.62 [2019-03-28 11:53:08,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.62 [2019-03-28 11:53:08,139 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.62 [2019-03-28 11:53:08,145 INFO L497 LassoAnalysis]: Using template 'affine'. 20.11/11.62 [2019-03-28 11:53:08,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.62 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.62 Number of strict supporting invariants: 0 20.11/11.62 Number of non-strict supporting invariants: 1 20.11/11.62 Consider only non-deceasing supporting invariants: true 20.11/11.62 Simplify termination arguments: true 20.11/11.62 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.62 [2019-03-28 11:53:08,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.62 [2019-03-28 11:53:08,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.62 [2019-03-28 11:53:08,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.62 [2019-03-28 11:53:08,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.62 [2019-03-28 11:53:08,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.62 [2019-03-28 11:53:08,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.62 [2019-03-28 11:53:08,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.62 [2019-03-28 11:53:08,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.11/11.62 [2019-03-28 11:53:08,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.11/11.62 [2019-03-28 11:53:08,169 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 20.11/11.62 [2019-03-28 11:53:08,171 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.11/11.62 [2019-03-28 11:53:08,171 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.11/11.62 [2019-03-28 11:53:08,172 INFO L518 LassoAnalysis]: Proved termination. 20.11/11.62 [2019-03-28 11:53:08,172 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.11/11.62 Ranking function f(ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_~maxId~0) = -2*ULTIMATE.start_main_~tmp~0 + 2*ULTIMATE.start_main_~maxId~0 + 1 20.11/11.62 Supporting invariants [] 20.11/11.62 [2019-03-28 11:53:08,174 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.11/11.62 [2019-03-28 11:53:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.62 [2019-03-28 11:53:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.62 [2019-03-28 11:53:08,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 20.11/11.62 [2019-03-28 11:53:08,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.62 [2019-03-28 11:53:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.62 [2019-03-28 11:53:08,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 20.11/11.62 [2019-03-28 11:53:08,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.62 [2019-03-28 11:53:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.62 [2019-03-28 11:53:08,255 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 20.11/11.62 [2019-03-28 11:53:08,260 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 20.11/11.62 [2019-03-28 11:53:08,261 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. 20.11/11.62 [2019-03-28 11:53:08,307 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 25 transitions. Complement of second has 4 states. 20.11/11.62 [2019-03-28 11:53:08,307 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 20.11/11.62 [2019-03-28 11:53:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.11/11.62 [2019-03-28 11:53:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. 20.11/11.62 [2019-03-28 11:53:08,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 1 letters. Loop has 2 letters. 20.11/11.62 [2019-03-28 11:53:08,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.62 [2019-03-28 11:53:08,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. 20.11/11.62 [2019-03-28 11:53:08,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.62 [2019-03-28 11:53:08,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 1 letters. Loop has 4 letters. 20.11/11.62 [2019-03-28 11:53:08,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.62 [2019-03-28 11:53:08,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.11/11.62 [2019-03-28 11:53:08,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 20.11/11.62 [2019-03-28 11:53:08,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.11/11.62 [2019-03-28 11:53:08,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.62 [2019-03-28 11:53:08,328 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 20.11/11.62 [2019-03-28 11:53:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 20.11/11.62 [2019-03-28 11:53:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,359 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,360 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,360 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.11/11.62 [2019-03-28 11:53:08,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 25 transitions. 20.11/11.62 [2019-03-28 11:53:08,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 20.11/11.62 [2019-03-28 11:53:08,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.62 [2019-03-28 11:53:08,361 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:08,361 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 20.11/11.63 [2019-03-28 11:53:08,361 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.63 [2019-03-28 11:53:08,362 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 42#L22-2 [51] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 43#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 44#L22-2 20.11/11.63 [2019-03-28 11:53:08,362 INFO L796 eck$LassoCheckResult]: Loop: 44#L22-2 [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 47#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 44#L22-2 20.11/11.63 [2019-03-28 11:53:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash 83309, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:08,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:08,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.11/11.63 [2019-03-28 11:53:08,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.11/11.63 [2019-03-28 11:53:08,403 INFO L799 eck$LassoCheckResult]: stem already infeasible 20.11/11.63 [2019-03-28 11:53:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2481, now seen corresponding path program 2 times 20.11/11.63 [2019-03-28 11:53:08,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:08,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:08,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:08,434 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:08,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:08,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:08,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:08,435 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.11/11.63 [2019-03-28 11:53:08,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:08,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:08,436 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:08,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.11/11.63 [2019-03-28 11:53:08,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:08,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:08,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:08,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:08,482 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:08,482 INFO L412 LassoAnalysis]: Checking for nontermination... 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:08,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:08,486 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:08,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:08,516 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:08,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:08,522 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:08,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:08,561 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:08,830 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.11/11.63 [2019-03-28 11:53:08,832 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:08,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:08,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:08,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:08,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.11/11.63 [2019-03-28 11:53:08,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:08,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:08,833 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:08,833 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 20.11/11.63 [2019-03-28 11:53:08,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:08,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:08,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:08,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:08,880 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:08,881 INFO L497 LassoAnalysis]: Using template 'affine'. 20.11/11.63 [2019-03-28 11:53:08,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:08,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:08,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:08,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:08,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:08,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:08,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:08,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:08,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.11/11.63 [2019-03-28 11:53:08,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:08,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:08,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:08,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:08,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:08,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:08,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:08,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:08,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.11/11.63 [2019-03-28 11:53:08,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.11/11.63 [2019-03-28 11:53:08,901 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 20.11/11.63 [2019-03-28 11:53:08,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.11/11.63 [2019-03-28 11:53:08,902 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.11/11.63 [2019-03-28 11:53:08,902 INFO L518 LassoAnalysis]: Proved termination. 20.11/11.63 [2019-03-28 11:53:08,902 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.11/11.63 Ranking function f(ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_~maxId~0) = -2*ULTIMATE.start_main_~tmp~0 + 2*ULTIMATE.start_main_~maxId~0 + 1 20.11/11.63 Supporting invariants [] 20.11/11.63 [2019-03-28 11:53:08,903 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 20.11/11.63 [2019-03-28 11:53:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:08,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:08,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:08,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:08,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:08,931 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 20.11/11.63 [2019-03-28 11:53:08,931 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 20.11/11.63 [2019-03-28 11:53:08,932 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 25 transitions. cyclomatic complexity: 20 Second operand 3 states. 20.11/11.63 [2019-03-28 11:53:08,959 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 25 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 9 states and 37 transitions. Complement of second has 4 states. 20.11/11.63 [2019-03-28 11:53:08,960 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 20.11/11.63 [2019-03-28 11:53:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 20.11/11.63 [2019-03-28 11:53:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. 20.11/11.63 [2019-03-28 11:53:08,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:08,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:08,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:08,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:08,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 4 letters. 20.11/11.63 [2019-03-28 11:53:08,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:08,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 37 transitions. 20.11/11.63 [2019-03-28 11:53:08,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.11/11.63 [2019-03-28 11:53:08,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 37 transitions. 20.11/11.63 [2019-03-28 11:53:08,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 20.11/11.63 [2019-03-28 11:53:08,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:08,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 37 transitions. 20.11/11.63 [2019-03-28 11:53:08,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:08,966 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 37 transitions. 20.11/11.63 [2019-03-28 11:53:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 37 transitions. 20.11/11.63 [2019-03-28 11:53:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. 20.11/11.63 [2019-03-28 11:53:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.11/11.63 [2019-03-28 11:53:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:08,968 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.11/11.63 [2019-03-28 11:53:08,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.11/11.63 [2019-03-28 11:53:08,972 INFO L87 Difference]: Start difference. First operand 5 states and 19 transitions. Second operand 3 states. 20.11/11.63 [2019-03-28 11:53:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.11/11.63 [2019-03-28 11:53:08,994 INFO L93 Difference]: Finished difference Result 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.11/11.63 [2019-03-28 11:53:08,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.11/11.63 [2019-03-28 11:53:08,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:08,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:08,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:08,998 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 29 transitions. 20.11/11.63 [2019-03-28 11:53:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 20.11/11.63 [2019-03-28 11:53:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.11/11.63 [2019-03-28 11:53:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. 20.11/11.63 [2019-03-28 11:53:09,000 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 28 transitions. 20.11/11.63 [2019-03-28 11:53:09,000 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 28 transitions. 20.11/11.63 [2019-03-28 11:53:09,000 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.11/11.63 [2019-03-28 11:53:09,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 28 transitions. 20.11/11.63 [2019-03-28 11:53:09,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.11/11.63 [2019-03-28 11:53:09,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.63 [2019-03-28 11:53:09,001 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:09,002 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 20.11/11.63 [2019-03-28 11:53:09,002 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.63 [2019-03-28 11:53:09,003 INFO L794 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 105#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 106#L22 20.11/11.63 [2019-03-28 11:53:09,003 INFO L796 eck$LassoCheckResult]: Loop: 106#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 107#L22-2 [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 106#L22 20.11/11.63 [2019-03-28 11:53:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2684, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2342, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2580705, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:09,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.11/11.63 [2019-03-28 11:53:09,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.11/11.63 [2019-03-28 11:53:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:09,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 20.11/11.63 [2019-03-28 11:53:09,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 20.11/11.63 [2019-03-28 11:53:09,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 20.11/11.63 [2019-03-28 11:53:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 20.11/11.63 [2019-03-28 11:53:09,130 INFO L87 Difference]: Start difference. First operand 8 states and 28 transitions. cyclomatic complexity: 21 Second operand 5 states. 20.11/11.63 [2019-03-28 11:53:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.11/11.63 [2019-03-28 11:53:09,209 INFO L93 Difference]: Finished difference Result 11 states and 26 transitions. 20.11/11.63 [2019-03-28 11:53:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 20.11/11.63 [2019-03-28 11:53:09,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 26 transitions. 20.11/11.63 [2019-03-28 11:53:09,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 20.11/11.63 [2019-03-28 11:53:09,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 24 transitions. 20.11/11.63 [2019-03-28 11:53:09,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:09,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:09,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 24 transitions. 20.11/11.63 [2019-03-28 11:53:09,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:09,214 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 24 transitions. 20.11/11.63 [2019-03-28 11:53:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 24 transitions. 20.11/11.63 [2019-03-28 11:53:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. 20.11/11.63 [2019-03-28 11:53:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 20.11/11.63 [2019-03-28 11:53:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. 20.11/11.63 [2019-03-28 11:53:09,216 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 22 transitions. 20.11/11.63 [2019-03-28 11:53:09,216 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 22 transitions. 20.11/11.63 [2019-03-28 11:53:09,216 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.11/11.63 [2019-03-28 11:53:09,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 22 transitions. 20.11/11.63 [2019-03-28 11:53:09,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 20.11/11.63 [2019-03-28 11:53:09,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.63 [2019-03-28 11:53:09,217 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:09,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 20.11/11.63 [2019-03-28 11:53:09,217 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.63 [2019-03-28 11:53:09,218 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 147#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 152#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 153#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 148#L22 20.11/11.63 [2019-03-28 11:53:09,218 INFO L796 eck$LassoCheckResult]: Loop: 148#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 149#L22-2 [50] L22-2-->L22: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 148#L22 20.11/11.63 [2019-03-28 11:53:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2580365, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2344, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1815235148, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:09,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:09,322 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:09,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:09,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:09,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:09,323 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.11/11.63 [2019-03-28 11:53:09,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:09,324 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:09,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.11/11.63 [2019-03-28 11:53:09,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:09,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:09,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,410 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:09,410 INFO L412 LassoAnalysis]: Checking for nontermination... 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:09,416 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:09,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:09,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:09,449 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:09,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:09,453 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:09,482 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:09,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:09,486 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:09,515 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:09,551 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:09,740 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.11/11.63 [2019-03-28 11:53:09,743 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:09,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:09,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:09,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:09,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.11/11.63 [2019-03-28 11:53:09,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:09,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:09,744 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:09,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 20.11/11.63 [2019-03-28 11:53:09,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:09,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:09,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:09,824 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:09,824 INFO L497 LassoAnalysis]: Using template 'affine'. 20.11/11.63 [2019-03-28 11:53:09,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:09,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:09,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:09,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:09,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:09,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:09,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:09,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:09,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.11/11.63 [2019-03-28 11:53:09,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:09,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:09,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:09,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:09,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:09,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:09,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:09,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:09,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.11/11.63 [2019-03-28 11:53:09,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:09,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:09,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:09,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:09,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:09,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:09,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:09,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:09,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.11/11.63 [2019-03-28 11:53:09,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:09,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:09,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:09,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:09,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:09,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:09,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:09,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.11/11.63 [2019-03-28 11:53:09,891 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 20.11/11.63 [2019-03-28 11:53:09,891 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. 20.11/11.63 [2019-03-28 11:53:09,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.11/11.63 [2019-03-28 11:53:09,894 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.11/11.63 [2019-03-28 11:53:09,894 INFO L518 LassoAnalysis]: Proved termination. 20.11/11.63 [2019-03-28 11:53:09,894 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.11/11.63 Ranking function f(ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_~tmp~0) = -1*ULTIMATE.start_main_~maxId~0 + 1*ULTIMATE.start_main_~tmp~0 20.11/11.63 Supporting invariants [1*ULTIMATE.start_main_~maxId~0 >= 0] 20.11/11.63 [2019-03-28 11:53:09,898 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.11/11.63 [2019-03-28 11:53:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:09,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:09,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:09,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:09,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:10,027 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 20.11/11.63 [2019-03-28 11:53:10,027 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 20.11/11.63 [2019-03-28 11:53:10,028 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 22 transitions. cyclomatic complexity: 15 Second operand 4 states. 20.11/11.63 [2019-03-28 11:53:10,183 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 22 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 93 states and 205 transitions. Complement of second has 35 states. 20.11/11.63 [2019-03-28 11:53:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 3 non-accepting loop states 2 accepting loop states 20.11/11.63 [2019-03-28 11:53:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.11/11.63 [2019-03-28 11:53:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. 20.11/11.63 [2019-03-28 11:53:10,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:10,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 6 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:10,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 4 letters. Loop has 4 letters. 20.11/11.63 [2019-03-28 11:53:10,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 205 transitions. 20.11/11.63 [2019-03-28 11:53:10,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 20.11/11.63 [2019-03-28 11:53:10,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 23 states and 50 transitions. 20.11/11.63 [2019-03-28 11:53:10,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 20.11/11.63 [2019-03-28 11:53:10,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 20.11/11.63 [2019-03-28 11:53:10,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 50 transitions. 20.11/11.63 [2019-03-28 11:53:10,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:10,193 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 50 transitions. 20.11/11.63 [2019-03-28 11:53:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 50 transitions. 20.11/11.63 [2019-03-28 11:53:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. 20.11/11.63 [2019-03-28 11:53:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 20.11/11.63 [2019-03-28 11:53:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 42 transitions. 20.11/11.63 [2019-03-28 11:53:10,196 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 42 transitions. 20.11/11.63 [2019-03-28 11:53:10,196 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 42 transitions. 20.11/11.63 [2019-03-28 11:53:10,196 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.11/11.63 [2019-03-28 11:53:10,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 42 transitions. 20.11/11.63 [2019-03-28 11:53:10,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 20.11/11.63 [2019-03-28 11:53:10,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.63 [2019-03-28 11:53:10,197 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:10,198 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 20.11/11.63 [2019-03-28 11:53:10,198 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 20.11/11.63 [2019-03-28 11:53:10,198 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 340#L22-2 [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 343#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 344#L22-2 [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 348#L22 20.11/11.63 [2019-03-28 11:53:10,198 INFO L796 eck$LassoCheckResult]: Loop: 348#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 352#L22-2 [50] L22-2-->L22: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 348#L22 20.11/11.63 [2019-03-28 11:53:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2579403, now seen corresponding path program 2 times 20.11/11.63 [2019-03-28 11:53:10,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:10,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2344, now seen corresponding path program 2 times 20.11/11.63 [2019-03-28 11:53:10,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1816159630, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:10,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:10,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:10,280 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:10,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:10,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:10,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:10,280 INFO L127 ssoRankerPreferences]: Use exernal solver: true 20.11/11.63 [2019-03-28 11:53:10,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:10,281 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:10,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.11/11.63 [2019-03-28 11:53:10,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:10,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:10,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,344 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:10,344 INFO L412 LassoAnalysis]: Checking for nontermination... 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:10,348 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:10,374 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:10,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-1} Honda state: {ULTIMATE.start_main_#t~nondet2=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:10,380 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:10,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:10,384 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:10,412 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:10,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. 20.11/11.63 [2019-03-28 11:53:10,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:10,443 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 20.11/11.63 [2019-03-28 11:53:10,475 INFO L163 nArgumentSynthesizer]: Using integer mode. 20.11/11.63 [2019-03-28 11:53:10,647 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 20.11/11.63 [2019-03-28 11:53:10,650 INFO L216 LassoAnalysis]: Preferences: 20.11/11.63 [2019-03-28 11:53:10,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.11/11.63 [2019-03-28 11:53:10,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.11/11.63 [2019-03-28 11:53:10,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.11/11.63 [2019-03-28 11:53:10,650 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.11/11.63 [2019-03-28 11:53:10,650 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.11/11.63 [2019-03-28 11:53:10,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.11/11.63 [2019-03-28 11:53:10,650 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.11/11.63 [2019-03-28 11:53:10,651 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 20.11/11.63 [2019-03-28 11:53:10,651 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.11/11.63 [2019-03-28 11:53:10,651 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.11/11.63 [2019-03-28 11:53:10,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.11/11.63 [2019-03-28 11:53:10,708 INFO L300 LassoAnalysis]: Preprocessing complete. 20.11/11.63 [2019-03-28 11:53:10,708 INFO L497 LassoAnalysis]: Using template 'affine'. 20.11/11.63 [2019-03-28 11:53:10,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:10,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:10,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.11/11.63 [2019-03-28 11:53:10,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:10,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:10,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:10,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:10,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:10,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.11/11.63 [2019-03-28 11:53:10,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.11/11.63 Termination analysis: LINEAR_WITH_GUESSES 20.11/11.63 Number of strict supporting invariants: 0 20.11/11.63 Number of non-strict supporting invariants: 1 20.11/11.63 Consider only non-deceasing supporting invariants: true 20.11/11.63 Simplify termination arguments: true 20.11/11.63 Simplify supporting invariants: trueOverapproximate stem: false 20.11/11.63 [2019-03-28 11:53:10,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.11/11.63 [2019-03-28 11:53:10,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.11/11.63 [2019-03-28 11:53:10,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.11/11.63 [2019-03-28 11:53:10,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.11/11.63 [2019-03-28 11:53:10,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.11/11.63 [2019-03-28 11:53:10,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.11/11.63 [2019-03-28 11:53:10,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.11/11.63 [2019-03-28 11:53:10,745 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 20.11/11.63 [2019-03-28 11:53:10,745 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. 20.11/11.63 [2019-03-28 11:53:10,746 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.11/11.63 [2019-03-28 11:53:10,747 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 20.11/11.63 [2019-03-28 11:53:10,748 INFO L518 LassoAnalysis]: Proved termination. 20.11/11.63 [2019-03-28 11:53:10,748 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.11/11.63 Ranking function f(ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_~tmp~0) = -1*ULTIMATE.start_main_~maxId~0 + 1*ULTIMATE.start_main_~tmp~0 20.11/11.63 Supporting invariants [1*ULTIMATE.start_main_~maxId~0 >= 0] 20.11/11.63 [2019-03-28 11:53:10,750 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 20.11/11.63 [2019-03-28 11:53:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:10,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:10,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:10,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:10,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:10,859 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 20.11/11.63 [2019-03-28 11:53:10,859 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 20.11/11.63 [2019-03-28 11:53:10,860 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 42 transitions. cyclomatic complexity: 28 Second operand 4 states. 20.11/11.63 [2019-03-28 11:53:10,984 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 42 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 160 states and 341 transitions. Complement of second has 35 states. 20.11/11.63 [2019-03-28 11:53:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 3 non-accepting loop states 2 accepting loop states 20.11/11.63 [2019-03-28 11:53:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 20.11/11.63 [2019-03-28 11:53:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. 20.11/11.63 [2019-03-28 11:53:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 6 letters. Loop has 2 letters. 20.11/11.63 [2019-03-28 11:53:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 4 letters. Loop has 4 letters. 20.11/11.63 [2019-03-28 11:53:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.11/11.63 [2019-03-28 11:53:10,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 341 transitions. 20.11/11.63 [2019-03-28 11:53:10,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 20.11/11.63 [2019-03-28 11:53:10,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 38 states and 77 transitions. 20.11/11.63 [2019-03-28 11:53:10,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 20.11/11.63 [2019-03-28 11:53:10,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 20.11/11.63 [2019-03-28 11:53:10,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 77 transitions. 20.11/11.63 [2019-03-28 11:53:10,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:10,996 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 77 transitions. 20.11/11.63 [2019-03-28 11:53:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 77 transitions. 20.11/11.63 [2019-03-28 11:53:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 10. 20.11/11.63 [2019-03-28 11:53:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.11/11.63 [2019-03-28 11:53:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. 20.11/11.63 [2019-03-28 11:53:10,998 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 23 transitions. 20.11/11.63 [2019-03-28 11:53:10,998 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 23 transitions. 20.11/11.63 [2019-03-28 11:53:10,998 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.11/11.63 [2019-03-28 11:53:10,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 23 transitions. 20.11/11.63 [2019-03-28 11:53:10,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 20.11/11.63 [2019-03-28 11:53:10,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.63 [2019-03-28 11:53:10,999 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:10,999 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] 20.11/11.63 [2019-03-28 11:53:10,999 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 20.11/11.63 [2019-03-28 11:53:11,000 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 608#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 611#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 612#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 609#L22 20.11/11.63 [2019-03-28 11:53:11,000 INFO L796 eck$LassoCheckResult]: Loop: 609#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 610#L22-2 [50] L22-2-->L22: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 614#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 616#L22-2 [48] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 609#L22 20.11/11.63 [2019-03-28 11:53:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2580365, now seen corresponding path program 2 times 20.11/11.63 [2019-03-28 11:53:11,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:11,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2253624, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:11,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:11,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.11/11.63 [2019-03-28 11:53:11,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.11/11.63 [2019-03-28 11:53:11,029 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.11/11.63 [2019-03-28 11:53:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.11/11.63 [2019-03-28 11:53:11,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 20.11/11.63 [2019-03-28 11:53:11,030 INFO L87 Difference]: Start difference. First operand 10 states and 23 transitions. cyclomatic complexity: 14 Second operand 4 states. 20.11/11.63 [2019-03-28 11:53:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.11/11.63 [2019-03-28 11:53:11,051 INFO L93 Difference]: Finished difference Result 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.11/11.63 [2019-03-28 11:53:11,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.11/11.63 [2019-03-28 11:53:11,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:11,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 20.11/11.63 [2019-03-28 11:53:11,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.11/11.63 [2019-03-28 11:53:11,054 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 20.11/11.63 [2019-03-28 11:53:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 20.11/11.63 [2019-03-28 11:53:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,056 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,056 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,056 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 20.11/11.63 [2019-03-28 11:53:11,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. 20.11/11.63 [2019-03-28 11:53:11,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 20.11/11.63 [2019-03-28 11:53:11,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.11/11.63 [2019-03-28 11:53:11,056 INFO L119 BuchiIsEmpty]: Starting construction of run 20.11/11.63 [2019-03-28 11:53:11,057 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] 20.11/11.63 [2019-03-28 11:53:11,057 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] 20.11/11.63 [2019-03-28 11:53:11,057 INFO L794 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~id~0_8 v_ULTIMATE.start_main_~maxId~0_8) (<= 0 v_ULTIMATE.start_main_~id~0_8) (= (+ v_ULTIMATE.start_main_~id~0_8 1) v_ULTIMATE.start_main_~tmp~0_9)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_8, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 635#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 642#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 641#L22-2 [49] L22-2-->L22: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 643#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 640#L22-2 [51] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 638#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 639#L22-2 [51] L22-2-->L22: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 636#L22 20.11/11.63 [2019-03-28 11:53:11,058 INFO L796 eck$LassoCheckResult]: Loop: 636#L22 [43] L22-->L22-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_5 v_ULTIMATE.start_main_~maxId~0_5) (= v_ULTIMATE.start_main_~tmp~0_4 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_5} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_5, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 637#L22-2 [50] L22-2-->L22: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 638#L22 [32] L22-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 639#L22-2 [50] L22-2-->L22: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_8 v_ULTIMATE.start_main_~id~0_7) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_8, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_7, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 636#L22 20.11/11.63 [2019-03-28 11:53:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash -684253048, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:11,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2253626, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:11,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.11/11.63 [2019-03-28 11:53:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.11/11.63 [2019-03-28 11:53:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash 775415873, now seen corresponding path program 1 times 20.11/11.63 [2019-03-28 11:53:11,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.11/11.63 [2019-03-28 11:53:11,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.11/11.63 [2019-03-28 11:53:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:11,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 20.11/11.63 [2019-03-28 11:53:11,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 20.11/11.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 20.11/11.63 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 20.11/11.63 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 20.11/11.63 [2019-03-28 11:53:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.11/11.63 [2019-03-28 11:53:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.11/11.63 [2019-03-28 11:53:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core 20.11/11.63 [2019-03-28 11:53:11,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.11/11.63 [2019-03-28 11:53:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 20.11/11.63 [2019-03-28 11:53:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 20.11/11.63 [2019-03-28 11:53:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 20.11/11.63 [2019-03-28 11:53:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 20.11/11.63 [2019-03-28 11:53:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 20.11/11.63 [2019-03-28 11:53:11,192 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 11 Second operand 5 states. 20.11/11.63 [2019-03-28 11:53:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.11/11.63 [2019-03-28 11:53:11,236 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. 20.11/11.63 [2019-03-28 11:53:11,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 20.11/11.63 [2019-03-28 11:53:11,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 16 transitions. 20.11/11.63 [2019-03-28 11:53:11,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.11/11.63 [2019-03-28 11:53:11,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 20.11/11.63 [2019-03-28 11:53:11,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 20.11/11.63 [2019-03-28 11:53:11,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.11/11.63 [2019-03-28 11:53:11,239 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,239 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,239 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,240 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 20.11/11.63 [2019-03-28 11:53:11,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 20.11/11.63 [2019-03-28 11:53:11,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 20.11/11.63 [2019-03-28 11:53:11,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 20.11/11.63 [2019-03-28 11:53:11,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:11 BasicIcfg 20.11/11.63 [2019-03-28 11:53:11,246 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.11/11.63 [2019-03-28 11:53:11,247 INFO L168 Benchmark]: Toolchain (without parser) took 4548.70 ms. Allocated memory was 649.6 MB in the beginning and 739.8 MB in the end (delta: 90.2 MB). Free memory was 566.0 MB in the beginning and 527.3 MB in the end (delta: 38.7 MB). Peak memory consumption was 128.9 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,249 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.95 ms. Allocated memory is still 649.6 MB. Free memory was 566.0 MB in the beginning and 556.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.36 ms. Allocated memory is still 649.6 MB. Free memory was 555.1 MB in the beginning and 616.4 MB in the end (delta: -61.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,250 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 ms. Allocated memory is still 649.6 MB. Free memory was 616.4 MB in the beginning and 615.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,251 INFO L168 Benchmark]: RCFGBuilder took 209.77 ms. Allocated memory is still 649.6 MB. Free memory was 615.4 MB in the beginning and 600.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,251 INFO L168 Benchmark]: BlockEncodingV2 took 83.36 ms. Allocated memory is still 649.6 MB. Free memory was 600.1 MB in the beginning and 594.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,252 INFO L168 Benchmark]: TraceAbstraction took 151.90 ms. Allocated memory is still 649.6 MB. Free memory was 594.7 MB in the beginning and 586.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,252 INFO L168 Benchmark]: BuchiAutomizer took 3755.60 ms. Allocated memory was 649.6 MB in the beginning and 739.8 MB in the end (delta: 90.2 MB). Free memory was 585.0 MB in the beginning and 527.3 MB in the end (delta: 57.7 MB). Peak memory consumption was 147.9 MB. Max. memory is 50.3 GB. 20.11/11.63 [2019-03-28 11:53:11,257 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.11/11.63 --- Results --- 20.11/11.63 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.11/11.63 - StatisticsResult: Initial Icfg 20.11/11.63 8 locations, 11 edges 20.11/11.63 - StatisticsResult: Encoded RCFG 20.11/11.63 3 locations, 7 edges 20.11/11.63 * Results from de.uni_freiburg.informatik.ultimate.core: 20.11/11.63 - StatisticsResult: Toolchain Benchmarks 20.11/11.63 Benchmark results are: 20.11/11.63 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.11/11.63 * CACSL2BoogieTranslator took 224.95 ms. Allocated memory is still 649.6 MB. Free memory was 566.0 MB in the beginning and 556.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 20.11/11.63 * Boogie Procedure Inliner took 98.36 ms. Allocated memory is still 649.6 MB. Free memory was 555.1 MB in the beginning and 616.4 MB in the end (delta: -61.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 20.11/11.63 * Boogie Preprocessor took 19.24 ms. Allocated memory is still 649.6 MB. Free memory was 616.4 MB in the beginning and 615.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 20.11/11.63 * RCFGBuilder took 209.77 ms. Allocated memory is still 649.6 MB. Free memory was 615.4 MB in the beginning and 600.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 50.3 GB. 20.11/11.63 * BlockEncodingV2 took 83.36 ms. Allocated memory is still 649.6 MB. Free memory was 600.1 MB in the beginning and 594.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 20.11/11.63 * TraceAbstraction took 151.90 ms. Allocated memory is still 649.6 MB. Free memory was 594.7 MB in the beginning and 586.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 20.11/11.63 * BuchiAutomizer took 3755.60 ms. Allocated memory was 649.6 MB in the beginning and 739.8 MB in the end (delta: 90.2 MB). Free memory was 585.0 MB in the beginning and 527.3 MB in the end (delta: 57.7 MB). Peak memory consumption was 147.9 MB. Max. memory is 50.3 GB. 20.11/11.63 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.11/11.63 - AllSpecificationsHoldResult: All specifications hold 20.11/11.63 We were not able to verify any specifiation because the program does not contain any specification. 20.11/11.63 - InvariantResult [Line: 21]: Loop Invariant 20.11/11.63 Derived loop invariant: 1 20.11/11.63 - StatisticsResult: Ultimate Automizer benchmark data 20.11/11.63 CFG has 1 procedures, 3 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=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 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 20.11/11.63 - StatisticsResult: Constructed decomposition of program 20.11/11.63 Your program was decomposed into 8 terminating modules (4 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * tmp + 2 * maxId + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * tmp + 2 * maxId + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * maxId + tmp and consists of 8 locations. One nondeterministic module has affine ranking function -1 * maxId + tmp and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. 20.11/11.63 - StatisticsResult: Timing statistics 20.11/11.63 BüchiAutomizer plugin needed 3.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 97 SDslu, 4 SDs, 0 SdLazy, 184 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT1 lasso2 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp84 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf94 smp100 dnf100 smp100 tf105 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 61ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s 20.11/11.63 - TerminationAnalysisResult: Termination proven 20.11/11.63 Buchi Automizer proved that your program is terminating 20.11/11.63 RESULT: Ultimate proved your program to be correct! 20.11/11.63 !SESSION 2019-03-28 11:53:01.540 ----------------------------------------------- 20.11/11.63 eclipse.buildId=unknown 20.11/11.63 java.version=1.8.0_181 20.11/11.63 java.vendor=Oracle Corporation 20.11/11.63 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.11/11.63 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 20.11/11.63 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 20.11/11.63 20.11/11.63 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:53:11.489 20.11/11.63 !MESSAGE The workspace will exit with unsaved changes in this session. 20.11/11.63 Received shutdown request... 20.11/11.63 Ultimate: 20.11/11.63 GTK+ Version Check 20.11/11.63 EOF