17.30/7.63 YES 17.30/7.63 17.30/7.63 Ultimate: Cannot open display: 17.30/7.63 This is Ultimate 0.1.24-8dc7c08-m 17.30/7.63 [2019-03-28 11:59:46,112 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.30/7.63 [2019-03-28 11:59:46,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.30/7.63 [2019-03-28 11:59:46,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.30/7.63 [2019-03-28 11:59:46,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.30/7.63 [2019-03-28 11:59:46,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.30/7.63 [2019-03-28 11:59:46,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.30/7.63 [2019-03-28 11:59:46,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.30/7.63 [2019-03-28 11:59:46,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.30/7.63 [2019-03-28 11:59:46,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.30/7.63 [2019-03-28 11:59:46,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.30/7.63 [2019-03-28 11:59:46,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.30/7.63 [2019-03-28 11:59:46,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.30/7.63 [2019-03-28 11:59:46,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.30/7.63 [2019-03-28 11:59:46,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.30/7.63 [2019-03-28 11:59:46,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.30/7.63 [2019-03-28 11:59:46,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.30/7.63 [2019-03-28 11:59:46,142 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.30/7.63 [2019-03-28 11:59:46,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.30/7.63 [2019-03-28 11:59:46,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.30/7.63 [2019-03-28 11:59:46,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.30/7.63 [2019-03-28 11:59:46,147 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.30/7.63 [2019-03-28 11:59:46,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.30/7.63 [2019-03-28 11:59:46,149 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.30/7.63 [2019-03-28 11:59:46,149 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.30/7.63 [2019-03-28 11:59:46,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.30/7.63 [2019-03-28 11:59:46,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.30/7.63 [2019-03-28 11:59:46,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.30/7.63 [2019-03-28 11:59:46,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.30/7.63 [2019-03-28 11:59:46,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.30/7.63 [2019-03-28 11:59:46,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.30/7.63 [2019-03-28 11:59:46,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.30/7.63 [2019-03-28 11:59:46,155 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 17.30/7.63 [2019-03-28 11:59:46,169 INFO L110 SettingsManager]: Loading preferences was successful 17.30/7.63 [2019-03-28 11:59:46,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.30/7.63 [2019-03-28 11:59:46,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.30/7.63 [2019-03-28 11:59:46,171 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.30/7.63 [2019-03-28 11:59:46,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.30/7.63 [2019-03-28 11:59:46,171 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.30/7.63 [2019-03-28 11:59:46,171 INFO L133 SettingsManager]: * Use SBE=true 17.30/7.63 [2019-03-28 11:59:46,172 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.30/7.63 [2019-03-28 11:59:46,172 INFO L133 SettingsManager]: * Use old map elimination=false 17.30/7.63 [2019-03-28 11:59:46,172 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.30/7.63 [2019-03-28 11:59:46,172 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.30/7.63 [2019-03-28 11:59:46,172 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.30/7.63 [2019-03-28 11:59:46,172 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.30/7.63 [2019-03-28 11:59:46,173 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.30/7.63 [2019-03-28 11:59:46,173 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.30/7.63 [2019-03-28 11:59:46,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.30/7.63 [2019-03-28 11:59:46,173 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.30/7.63 [2019-03-28 11:59:46,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.30/7.63 [2019-03-28 11:59:46,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.30/7.63 [2019-03-28 11:59:46,174 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.30/7.63 [2019-03-28 11:59:46,174 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.30/7.63 [2019-03-28 11:59:46,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.30/7.63 [2019-03-28 11:59:46,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.30/7.63 [2019-03-28 11:59:46,174 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.30/7.63 [2019-03-28 11:59:46,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.30/7.63 [2019-03-28 11:59:46,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.30/7.63 [2019-03-28 11:59:46,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.30/7.63 [2019-03-28 11:59:46,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.30/7.63 [2019-03-28 11:59:46,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.30/7.63 [2019-03-28 11:59:46,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.30/7.63 [2019-03-28 11:59:46,214 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.30/7.63 [2019-03-28 11:59:46,218 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.30/7.63 [2019-03-28 11:59:46,219 INFO L271 PluginConnector]: Initializing CDTParser... 17.30/7.63 [2019-03-28 11:59:46,219 INFO L276 PluginConnector]: CDTParser initialized 17.30/7.63 [2019-03-28 11:59:46,220 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 17.30/7.63 [2019-03-28 11:59:46,306 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/32d2e10d88b643e8ba9a82c53537d008/FLAG763987dc1 17.30/7.63 [2019-03-28 11:59:46,644 INFO L307 CDTParser]: Found 1 translation units. 17.30/7.63 [2019-03-28 11:59:46,645 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 17.30/7.63 [2019-03-28 11:59:46,652 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/32d2e10d88b643e8ba9a82c53537d008/FLAG763987dc1 17.30/7.63 [2019-03-28 11:59:47,047 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/32d2e10d88b643e8ba9a82c53537d008 17.30/7.63 [2019-03-28 11:59:47,059 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.30/7.63 [2019-03-28 11:59:47,062 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.30/7.63 [2019-03-28 11:59:47,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.30/7.63 [2019-03-28 11:59:47,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.30/7.63 [2019-03-28 11:59:47,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.30/7.63 [2019-03-28 11:59:47,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fdd170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47, skipping insertion in model container 17.30/7.63 [2019-03-28 11:59:47,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.30/7.63 [2019-03-28 11:59:47,097 INFO L176 MainTranslator]: Built tables and reachable declarations 17.30/7.63 [2019-03-28 11:59:47,262 INFO L206 PostProcessor]: Analyzing one entry point: main 17.30/7.63 [2019-03-28 11:59:47,267 INFO L191 MainTranslator]: Completed pre-run 17.30/7.63 [2019-03-28 11:59:47,288 INFO L206 PostProcessor]: Analyzing one entry point: main 17.30/7.63 [2019-03-28 11:59:47,370 INFO L195 MainTranslator]: Completed translation 17.30/7.63 [2019-03-28 11:59:47,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47 WrapperNode 17.30/7.63 [2019-03-28 11:59:47,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.30/7.63 [2019-03-28 11:59:47,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.30/7.63 [2019-03-28 11:59:47,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.30/7.63 [2019-03-28 11:59:47,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.30/7.63 [2019-03-28 11:59:47,381 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:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,390 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:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.30/7.63 [2019-03-28 11:59:47,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.30/7.63 [2019-03-28 11:59:47,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.30/7.63 [2019-03-28 11:59:47,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.30/7.63 [2019-03-28 11:59:47,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.30/7.63 [2019-03-28 11:59:47,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.30/7.63 [2019-03-28 11:59:47,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.30/7.63 [2019-03-28 11:59:47,434 INFO L276 PluginConnector]: RCFGBuilder initialized 17.30/7.63 [2019-03-28 11:59:47,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (1/1) ... 17.30/7.63 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.30/7.63 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.30/7.63 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.30/7.63 [2019-03-28 11:59:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.30/7.63 [2019-03-28 11:59:47,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.30/7.63 [2019-03-28 11:59:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 17.30/7.63 [2019-03-28 11:59:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 17.30/7.63 [2019-03-28 11:59:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 17.30/7.63 [2019-03-28 11:59:47,674 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.30/7.63 [2019-03-28 11:59:47,675 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.30/7.63 [2019-03-28 11:59:47,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:59:47 BoogieIcfgContainer 17.30/7.63 [2019-03-28 11:59:47,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.30/7.63 [2019-03-28 11:59:47,677 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.30/7.63 [2019-03-28 11:59:47,677 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.30/7.63 [2019-03-28 11:59:47,679 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.30/7.63 [2019-03-28 11:59:47,680 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:59:47" (1/1) ... 17.30/7.63 [2019-03-28 11:59:47,695 INFO L313 BlockEncoder]: Initial Icfg 16 locations, 19 edges 17.30/7.63 [2019-03-28 11:59:47,697 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.30/7.63 [2019-03-28 11:59:47,698 INFO L263 BlockEncoder]: Using Maximize final states 17.30/7.63 [2019-03-28 11:59:47,698 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.30/7.63 [2019-03-28 11:59:47,699 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.30/7.63 [2019-03-28 11:59:47,701 INFO L296 BlockEncoder]: Using Remove sink states 17.30/7.63 [2019-03-28 11:59:47,702 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.30/7.63 [2019-03-28 11:59:47,702 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.30/7.63 [2019-03-28 11:59:47,719 INFO L185 BlockEncoder]: Using Use SBE 17.30/7.63 [2019-03-28 11:59:47,737 INFO L200 BlockEncoder]: SBE split 5 edges 17.30/7.63 [2019-03-28 11:59:47,741 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.30/7.63 [2019-03-28 11:59:47,743 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.30/7.63 [2019-03-28 11:59:47,760 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 17.30/7.63 [2019-03-28 11:59:47,762 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 17.30/7.63 [2019-03-28 11:59:47,763 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.30/7.63 [2019-03-28 11:59:47,763 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.30/7.63 [2019-03-28 11:59:47,767 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 17.30/7.63 [2019-03-28 11:59:47,768 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.30/7.63 [2019-03-28 11:59:47,768 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.30/7.63 [2019-03-28 11:59:47,769 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.30/7.63 [2019-03-28 11:59:47,769 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.30/7.63 [2019-03-28 11:59:47,769 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.30/7.63 [2019-03-28 11:59:47,770 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 14 edges 17.30/7.63 [2019-03-28 11:59:47,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:59:47 BasicIcfg 17.30/7.63 [2019-03-28 11:59:47,770 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.30/7.63 [2019-03-28 11:59:47,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.30/7.63 [2019-03-28 11:59:47,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.30/7.63 [2019-03-28 11:59:47,775 INFO L276 PluginConnector]: TraceAbstraction initialized 17.30/7.63 [2019-03-28 11:59:47,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:59:47" (1/4) ... 17.30/7.63 [2019-03-28 11:59:47,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f79f1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:59:47, skipping insertion in model container 17.30/7.63 [2019-03-28 11:59:47,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (2/4) ... 17.30/7.63 [2019-03-28 11:59:47,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f79f1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:59:47, skipping insertion in model container 17.30/7.63 [2019-03-28 11:59:47,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:59:47" (3/4) ... 17.30/7.63 [2019-03-28 11:59:47,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f79f1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:59:47, skipping insertion in model container 17.30/7.63 [2019-03-28 11:59:47,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:59:47" (4/4) ... 17.30/7.63 [2019-03-28 11:59:47,779 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.30/7.63 [2019-03-28 11:59:47,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.30/7.63 [2019-03-28 11:59:47,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. 17.30/7.63 [2019-03-28 11:59:47,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. 17.30/7.63 [2019-03-28 11:59:47,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.30/7.63 [2019-03-28 11:59:47,849 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.30/7.63 [2019-03-28 11:59:47,849 INFO L383 AbstractCegarLoop]: Hoare is true 17.30/7.63 [2019-03-28 11:59:47,849 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.30/7.63 [2019-03-28 11:59:47,849 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.30/7.63 [2019-03-28 11:59:47,849 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.30/7.63 [2019-03-28 11:59:47,849 INFO L387 AbstractCegarLoop]: Difference is false 17.30/7.63 [2019-03-28 11:59:47,850 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.30/7.63 [2019-03-28 11:59:47,850 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.30/7.63 [2019-03-28 11:59:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 17.30/7.63 [2019-03-28 11:59:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.30/7.63 [2019-03-28 11:59:47,871 INFO L394 BasicCegarLoop]: Found error trace 17.30/7.63 [2019-03-28 11:59:47,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.30/7.63 [2019-03-28 11:59:47,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 17.30/7.63 [2019-03-28 11:59:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.63 [2019-03-28 11:59:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash 3129328, now seen corresponding path program 1 times 17.30/7.63 [2019-03-28 11:59:47,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.63 [2019-03-28 11:59:47,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.63 [2019-03-28 11:59:47,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:47,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:47,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.63 [2019-03-28 11:59:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.63 [2019-03-28 11:59:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.30/7.63 [2019-03-28 11:59:48,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.30/7.63 [2019-03-28 11:59:48,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.30/7.63 [2019-03-28 11:59:48,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.30/7.63 [2019-03-28 11:59:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.30/7.63 [2019-03-28 11:59:48,065 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. 17.30/7.63 [2019-03-28 11:59:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.30/7.63 [2019-03-28 11:59:48,122 INFO L93 Difference]: Finished difference Result 9 states and 14 transitions. 17.30/7.63 [2019-03-28 11:59:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.30/7.63 [2019-03-28 11:59:48,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 17.30/7.63 [2019-03-28 11:59:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.30/7.63 [2019-03-28 11:59:48,136 INFO L225 Difference]: With dead ends: 9 17.30/7.63 [2019-03-28 11:59:48,136 INFO L226 Difference]: Without dead ends: 7 17.30/7.63 [2019-03-28 11:59:48,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.30/7.63 [2019-03-28 11:59:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. 17.30/7.63 [2019-03-28 11:59:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 17.30/7.63 [2019-03-28 11:59:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 17.30/7.63 [2019-03-28 11:59:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. 17.30/7.63 [2019-03-28 11:59:48,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 10 transitions. Word has length 4 17.30/7.63 [2019-03-28 11:59:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. 17.30/7.63 [2019-03-28 11:59:48,175 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 10 transitions. 17.30/7.63 [2019-03-28 11:59:48,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.30/7.63 [2019-03-28 11:59:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. 17.30/7.63 [2019-03-28 11:59:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.30/7.63 [2019-03-28 11:59:48,175 INFO L394 BasicCegarLoop]: Found error trace 17.30/7.63 [2019-03-28 11:59:48,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.30/7.63 [2019-03-28 11:59:48,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 17.30/7.63 [2019-03-28 11:59:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.63 [2019-03-28 11:59:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash 3129330, now seen corresponding path program 1 times 17.30/7.63 [2019-03-28 11:59:48,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.63 [2019-03-28 11:59:48,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.63 [2019-03-28 11:59:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:48,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.63 [2019-03-28 11:59:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.63 [2019-03-28 11:59:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.30/7.63 [2019-03-28 11:59:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.30/7.63 [2019-03-28 11:59:48,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 17.30/7.63 [2019-03-28 11:59:48,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.30/7.63 [2019-03-28 11:59:48,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 17.30/7.63 [2019-03-28 11:59:48,225 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. 17.30/7.63 [2019-03-28 11:59:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.30/7.63 [2019-03-28 11:59:48,276 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. 17.30/7.63 [2019-03-28 11:59:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.30/7.63 [2019-03-28 11:59:48,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 17.30/7.63 [2019-03-28 11:59:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.30/7.63 [2019-03-28 11:59:48,277 INFO L225 Difference]: With dead ends: 10 17.30/7.63 [2019-03-28 11:59:48,277 INFO L226 Difference]: Without dead ends: 8 17.30/7.63 [2019-03-28 11:59:48,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 17.30/7.63 [2019-03-28 11:59:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 17.30/7.63 [2019-03-28 11:59:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. 17.30/7.63 [2019-03-28 11:59:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 17.30/7.63 [2019-03-28 11:59:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. 17.30/7.63 [2019-03-28 11:59:48,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 17.30/7.63 [2019-03-28 11:59:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. 17.30/7.63 [2019-03-28 11:59:48,281 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. 17.30/7.63 [2019-03-28 11:59:48,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 17.30/7.63 [2019-03-28 11:59:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. 17.30/7.63 [2019-03-28 11:59:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 17.30/7.63 [2019-03-28 11:59:48,282 INFO L394 BasicCegarLoop]: Found error trace 17.30/7.63 [2019-03-28 11:59:48,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 17.30/7.63 [2019-03-28 11:59:48,283 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 17.30/7.63 [2019-03-28 11:59:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.63 [2019-03-28 11:59:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash 3129331, now seen corresponding path program 1 times 17.30/7.63 [2019-03-28 11:59:48,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.63 [2019-03-28 11:59:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.63 [2019-03-28 11:59:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.63 [2019-03-28 11:59:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.64 [2019-03-28 11:59:48,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.30/7.64 [2019-03-28 11:59:48,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.30/7.64 [2019-03-28 11:59:48,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 17.30/7.64 [2019-03-28 11:59:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.30/7.64 [2019-03-28 11:59:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.30/7.64 [2019-03-28 11:59:48,327 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. 17.30/7.64 [2019-03-28 11:59:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.30/7.64 [2019-03-28 11:59:48,351 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. 17.30/7.64 [2019-03-28 11:59:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.30/7.64 [2019-03-28 11:59:48,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 17.30/7.64 [2019-03-28 11:59:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.30/7.64 [2019-03-28 11:59:48,353 INFO L225 Difference]: With dead ends: 12 17.30/7.64 [2019-03-28 11:59:48,353 INFO L226 Difference]: Without dead ends: 10 17.30/7.64 [2019-03-28 11:59:48,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.30/7.64 [2019-03-28 11:59:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. 17.30/7.64 [2019-03-28 11:59:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 17.30/7.64 [2019-03-28 11:59:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 17.30/7.64 [2019-03-28 11:59:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:48,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 4 17.30/7.64 [2019-03-28 11:59:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. 17.30/7.64 [2019-03-28 11:59:48,357 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:48,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 17.30/7.64 [2019-03-28 11:59:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 17.30/7.64 [2019-03-28 11:59:48,358 INFO L394 BasicCegarLoop]: Found error trace 17.30/7.64 [2019-03-28 11:59:48,358 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] 17.30/7.64 [2019-03-28 11:59:48,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 17.30/7.64 [2019-03-28 11:59:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1263069973, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:48,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:48,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.64 [2019-03-28 11:59:48,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.30/7.64 [2019-03-28 11:59:48,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.30/7.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.30/7.64 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.30/7.64 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.30/7.64 [2019-03-28 11:59:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:48,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core 17.30/7.64 [2019-03-28 11:59:48,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.30/7.64 [2019-03-28 11:59:48,540 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 17.30/7.64 [2019-03-28 11:59:48,541 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 17.30/7.64 [2019-03-28 11:59:48,548 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 17.30/7.64 [2019-03-28 11:59:48,549 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 17.30/7.64 [2019-03-28 11:59:48,550 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 17.30/7.64 [2019-03-28 11:59:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.64 [2019-03-28 11:59:48,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.30/7.64 [2019-03-28 11:59:48,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 17.30/7.64 [2019-03-28 11:59:48,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 17.30/7.64 [2019-03-28 11:59:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 17.30/7.64 [2019-03-28 11:59:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 17.30/7.64 [2019-03-28 11:59:48,591 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. 17.30/7.64 [2019-03-28 11:59:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.30/7.64 [2019-03-28 11:59:48,684 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 17.30/7.64 [2019-03-28 11:59:48,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 17.30/7.64 [2019-03-28 11:59:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 17.30/7.64 [2019-03-28 11:59:48,685 INFO L225 Difference]: With dead ends: 10 17.30/7.64 [2019-03-28 11:59:48,685 INFO L226 Difference]: Without dead ends: 0 17.30/7.64 [2019-03-28 11:59:48,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 17.30/7.64 [2019-03-28 11:59:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 17.30/7.64 [2019-03-28 11:59:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 17.30/7.64 [2019-03-28 11:59:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 17.30/7.64 [2019-03-28 11:59:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:48,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 17.30/7.64 [2019-03-28 11:59:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. 17.30/7.64 [2019-03-28 11:59:48,687 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:48,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 17.30/7.64 [2019-03-28 11:59:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:48,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.30/7.64 [2019-03-28 11:59:48,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:48,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,760 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,761 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,761 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 24) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#a~0.offset| 0) (<= 1 ULTIMATE.start_main_~offset~0) (= (* 4 ULTIMATE.start_main_~a_length~0) (select |#length| |ULTIMATE.start_main_~#a~0.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|)) (<= 0 ULTIMATE.start_main_~i~0)) 17.30/7.64 [2019-03-28 11:59:48,762 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. 17.30/7.64 [2019-03-28 11:59:48,762 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 17.30/7.64 [2019-03-28 11:59:48,770 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 17.30/7.64 [2019-03-28 11:59:48,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 17.30/7.64 [2019-03-28 11:59:48,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:59:48 BasicIcfg 17.30/7.64 [2019-03-28 11:59:48,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.30/7.64 [2019-03-28 11:59:48,779 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.30/7.64 [2019-03-28 11:59:48,780 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.30/7.64 [2019-03-28 11:59:48,783 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.30/7.64 [2019-03-28 11:59:48,784 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.30/7.64 [2019-03-28 11:59:48,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:59:47" (1/5) ... 17.30/7.64 [2019-03-28 11:59:48,784 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@212fa57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:59:48, skipping insertion in model container 17.30/7.64 [2019-03-28 11:59:48,785 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.30/7.64 [2019-03-28 11:59:48,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:59:47" (2/5) ... 17.30/7.64 [2019-03-28 11:59:48,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@212fa57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:59:48, skipping insertion in model container 17.30/7.64 [2019-03-28 11:59:48,785 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.30/7.64 [2019-03-28 11:59:48,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:59:47" (3/5) ... 17.30/7.64 [2019-03-28 11:59:48,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@212fa57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:48, skipping insertion in model container 17.30/7.64 [2019-03-28 11:59:48,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.30/7.64 [2019-03-28 11:59:48,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:59:47" (4/5) ... 17.30/7.64 [2019-03-28 11:59:48,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@212fa57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:48, skipping insertion in model container 17.30/7.64 [2019-03-28 11:59:48,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.30/7.64 [2019-03-28 11:59:48,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:59:48" (5/5) ... 17.30/7.64 [2019-03-28 11:59:48,788 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.30/7.64 [2019-03-28 11:59:48,809 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.30/7.64 [2019-03-28 11:59:48,809 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.30/7.64 [2019-03-28 11:59:48,809 INFO L375 BuchiCegarLoop]: Hoare is true 17.30/7.64 [2019-03-28 11:59:48,809 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.30/7.64 [2019-03-28 11:59:48,810 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.30/7.64 [2019-03-28 11:59:48,810 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.30/7.64 [2019-03-28 11:59:48,810 INFO L379 BuchiCegarLoop]: Difference is false 17.30/7.64 [2019-03-28 11:59:48,810 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.30/7.64 [2019-03-28 11:59:48,810 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.30/7.64 [2019-03-28 11:59:48,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 17.30/7.64 [2019-03-28 11:59:48,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.30/7.64 [2019-03-28 11:59:48,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.30/7.64 [2019-03-28 11:59:48,818 INFO L119 BuchiIsEmpty]: Starting construction of run 17.30/7.64 [2019-03-28 11:59:48,822 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.30/7.64 [2019-03-28 11:59:48,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.30/7.64 [2019-03-28 11:59:48,823 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.30/7.64 [2019-03-28 11:59:48,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 17.30/7.64 [2019-03-28 11:59:48,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.30/7.64 [2019-03-28 11:59:48,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.30/7.64 [2019-03-28 11:59:48,824 INFO L119 BuchiIsEmpty]: Starting construction of run 17.30/7.64 [2019-03-28 11:59:48,824 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.30/7.64 [2019-03-28 11:59:48,824 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.30/7.64 [2019-03-28 11:59:48,829 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [72] ULTIMATE.startENTRY-->L13: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_9|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_11|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_4, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_7|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_8, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~offset~0, ULTIMATE.start_main_#t~mem1, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0, #NULL.base] 8#L13true [63] L13-->L19-2: Formula: (and (> |v_ULTIMATE.start_main_~#a~0.base_4| 0) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_4|) (= v_ULTIMATE.start_main_~i~0_2 0) (>= v_ULTIMATE.start_main_~a_length~0_5 1) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_4| (* 4 v_ULTIMATE.start_main_~a_length~0_5)) |v_#length_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~offset~0_2 1) (< |v_ULTIMATE.start_main_~#a~0.base_4| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_4|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_4|, #valid=|v_#valid_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_2, #length=|v_#length_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_2, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, #valid, ULTIMATE.start_main_~offset~0, #length, ULTIMATE.start_main_~i~0] 5#L19-2true 17.30/7.64 [2019-03-28 11:59:48,830 INFO L796 eck$LassoCheckResult]: Loop: 5#L19-2true [39] L19-2-->L20: Formula: (< v_ULTIMATE.start_main_~i~0_4 v_ULTIMATE.start_main_~a_length~0_7) InVars {ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} OutVars{ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[] 11#L20true [75] L20-->L23: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#a~0.offset_11|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_main_~#a~0.offset_11| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#a~0.base_13|)) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#a~0.base_13|) 1) (<= 0 (select (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#a~0.base_13|) .cse0))))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 7#L23true [74] L23-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_13))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse1))) (and (= (+ (select (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#a~0.base_12|) .cse0) v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~offset~0_5) v_ULTIMATE.start_main_~i~0_12) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse1 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#a~0.base_12|)) (<= 0 .cse0) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_main_~#a~0.base_12|))))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~i~0] 5#L19-2true 17.30/7.64 [2019-03-28 11:59:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 3256, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:48,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:48,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 69669, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:48,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:48,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash 97039374, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:48,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:48,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,011 INFO L216 LassoAnalysis]: Preferences: 17.30/7.64 [2019-03-28 11:59:49,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.30/7.64 [2019-03-28 11:59:49,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.30/7.64 [2019-03-28 11:59:49,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.30/7.64 [2019-03-28 11:59:49,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.30/7.64 [2019-03-28 11:59:49,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.30/7.64 [2019-03-28 11:59:49,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.30/7.64 [2019-03-28 11:59:49,014 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.30/7.64 [2019-03-28 11:59:49,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 17.30/7.64 [2019-03-28 11:59:49,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.30/7.64 [2019-03-28 11:59:49,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.30/7.64 [2019-03-28 11:59:49,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,268 INFO L300 LassoAnalysis]: Preprocessing complete. 17.30/7.64 [2019-03-28 11:59:49,274 INFO L497 LassoAnalysis]: Using template 'affine'. 17.30/7.64 [2019-03-28 11:59:49,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.30/7.64 [2019-03-28 11:59:49,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.30/7.64 [2019-03-28 11:59:49,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.30/7.64 [2019-03-28 11:59:49,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:49,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:49,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:49,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:49,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:49,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:49,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:49,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:49,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.30/7.64 [2019-03-28 11:59:49,413 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 17.30/7.64 [2019-03-28 11:59:49,413 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. 17.30/7.64 [2019-03-28 11:59:49,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.30/7.64 [2019-03-28 11:59:49,418 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 17.30/7.64 [2019-03-28 11:59:49,418 INFO L518 LassoAnalysis]: Proved termination. 17.30/7.64 [2019-03-28 11:59:49,418 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.30/7.64 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~a_length~0 17.30/7.64 Supporting invariants [1*ULTIMATE.start_main_~offset~0 - 1 >= 0] 17.30/7.64 [2019-03-28 11:59:49,434 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed 17.30/7.64 [2019-03-28 11:59:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:49,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core 17.30/7.64 [2019-03-28 11:59:49,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.30/7.64 [2019-03-28 11:59:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:49,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 17.30/7.64 [2019-03-28 11:59:49,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.30/7.64 [2019-03-28 11:59:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.64 [2019-03-28 11:59:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,592 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 17.30/7.64 [2019-03-28 11:59:49,592 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 17.30/7.64 [2019-03-28 11:59:49,595 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 4 loop predicates 17.30/7.64 [2019-03-28 11:59:49,596 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 17.30/7.64 [2019-03-28 11:59:49,717 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 23 states and 37 transitions. Complement of second has 7 states. 17.30/7.64 [2019-03-28 11:59:49,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 17.30/7.64 [2019-03-28 11:59:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.30/7.64 [2019-03-28 11:59:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. 17.30/7.64 [2019-03-28 11:59:49,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. 17.30/7.64 [2019-03-28 11:59:49,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:49,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. 17.30/7.64 [2019-03-28 11:59:49,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:49,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. 17.30/7.64 [2019-03-28 11:59:49,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:49,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 37 transitions. 17.30/7.64 [2019-03-28 11:59:49,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.30/7.64 [2019-03-28 11:59:49,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 17.30/7.64 [2019-03-28 11:59:49,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 17.30/7.64 [2019-03-28 11:59:49,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.30/7.64 [2019-03-28 11:59:49,734 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 17.30/7.64 [2019-03-28 11:59:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 17.30/7.64 [2019-03-28 11:59:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,736 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,736 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.30/7.64 [2019-03-28 11:59:49,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. 17.30/7.64 [2019-03-28 11:59:49,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.30/7.64 [2019-03-28 11:59:49,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.30/7.64 [2019-03-28 11:59:49,737 INFO L119 BuchiIsEmpty]: Starting construction of run 17.30/7.64 [2019-03-28 11:59:49,737 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.30/7.64 [2019-03-28 11:59:49,737 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.30/7.64 [2019-03-28 11:59:49,738 INFO L794 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY [72] ULTIMATE.startENTRY-->L13: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_9|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_11|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_4, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_7|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_8, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~offset~0, ULTIMATE.start_main_#t~mem1, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~a_length~0, #NULL.base] 97#L13 [62] L13-->L19-2: Formula: (and (= 0 |v_ULTIMATE.start_main_~#a~0.offset_4|) (< |v_ULTIMATE.start_main_~#a~0.base_4| 0) (= v_ULTIMATE.start_main_~i~0_2 0) (>= v_ULTIMATE.start_main_~a_length~0_5 1) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_4| (* 4 v_ULTIMATE.start_main_~a_length~0_5)) |v_#length_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~offset~0_2 1) (< |v_ULTIMATE.start_main_~#a~0.base_4| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_~#a~0.base_4|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_4|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_4|, #valid=|v_#valid_5|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_2, #length=|v_#length_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_2, ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, #valid, ULTIMATE.start_main_~offset~0, #length, ULTIMATE.start_main_~i~0] 98#L19-2 17.30/7.64 [2019-03-28 11:59:49,738 INFO L796 eck$LassoCheckResult]: Loop: 98#L19-2 [39] L19-2-->L20: Formula: (< v_ULTIMATE.start_main_~i~0_4 v_ULTIMATE.start_main_~a_length~0_7) InVars {ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} OutVars{ULTIMATE.start_main_~a_length~0=v_ULTIMATE.start_main_~a_length~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[] 99#L20 [75] L20-->L23: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_14))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#a~0.offset_11|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_main_~#a~0.offset_11| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#a~0.base_13|)) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#a~0.base_13|) 1) (<= 0 (select (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#a~0.base_13|) .cse0))))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_11|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_13|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 100#L23 [74] L23-->L19-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~i~0_13))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse1))) (and (= (+ (select (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#a~0.base_12|) .cse0) v_ULTIMATE.start_main_~i~0_13 v_ULTIMATE.start_main_~offset~0_5) v_ULTIMATE.start_main_~i~0_12) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_10| .cse1 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#a~0.base_12|)) (<= 0 .cse0) (= 1 (select |v_#valid_13| |v_ULTIMATE.start_main_~#a~0.base_12|))))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_10|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_12|, #valid=|v_#valid_13|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, ULTIMATE.start_main_~offset~0=v_ULTIMATE.start_main_~offset~0_5, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~i~0] 98#L19-2 17.30/7.64 [2019-03-28 11:59:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 3255, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:49,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash 69669, now seen corresponding path program 2 times 17.30/7.64 [2019-03-28 11:59:49,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash 97009583, now seen corresponding path program 1 times 17.30/7.64 [2019-03-28 11:59:49,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.30/7.64 [2019-03-28 11:59:49,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.30/7.64 [2019-03-28 11:59:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.30/7.64 [2019-03-28 11:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:49,858 INFO L216 LassoAnalysis]: Preferences: 17.30/7.64 [2019-03-28 11:59:49,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.30/7.64 [2019-03-28 11:59:49,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.30/7.64 [2019-03-28 11:59:49,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.30/7.64 [2019-03-28 11:59:49,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.30/7.64 [2019-03-28 11:59:49,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.30/7.64 [2019-03-28 11:59:49,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.30/7.64 [2019-03-28 11:59:49,859 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.30/7.64 [2019-03-28 11:59:49,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 17.30/7.64 [2019-03-28 11:59:49,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.30/7.64 [2019-03-28 11:59:49,860 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.30/7.64 [2019-03-28 11:59:49,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:49,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.30/7.64 [2019-03-28 11:59:50,042 INFO L300 LassoAnalysis]: Preprocessing complete. 17.30/7.64 [2019-03-28 11:59:50,042 INFO L497 LassoAnalysis]: Using template 'affine'. 17.30/7.64 [2019-03-28 11:59:50,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:50,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:50,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:50,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:50,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:50,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:50,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:50,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:50,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:50,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:50,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:50,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:50,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:50,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:50,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:50,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.30/7.64 [2019-03-28 11:59:50,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.30/7.64 Termination analysis: LINEAR_WITH_GUESSES 17.30/7.64 Number of strict supporting invariants: 0 17.30/7.64 Number of non-strict supporting invariants: 1 17.30/7.64 Consider only non-deceasing supporting invariants: true 17.30/7.64 Simplify termination arguments: true 17.30/7.64 Simplify supporting invariants: trueOverapproximate stem: false 17.30/7.64 [2019-03-28 11:59:50,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.30/7.64 [2019-03-28 11:59:50,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.30/7.64 [2019-03-28 11:59:50,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.30/7.64 [2019-03-28 11:59:50,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.30/7.64 [2019-03-28 11:59:50,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 17.30/7.64 [2019-03-28 11:59:50,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 17.30/7.64 [2019-03-28 11:59:50,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.30/7.64 [2019-03-28 11:59:50,104 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 17.30/7.64 [2019-03-28 11:59:50,105 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. 17.30/7.64 [2019-03-28 11:59:50,105 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.30/7.64 [2019-03-28 11:59:50,107 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 17.30/7.64 [2019-03-28 11:59:50,107 INFO L518 LassoAnalysis]: Proved termination. 17.30/7.64 [2019-03-28 11:59:50,107 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.30/7.64 Ranking function f(ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_2) = -1*ULTIMATE.start_main_~#a~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_2 17.30/7.64 Supporting invariants [1*ULTIMATE.start_main_~offset~0 - 1 >= 0] 17.30/7.64 [2019-03-28 11:59:50,112 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed 17.30/7.64 [2019-03-28 11:59:50,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 17.30/7.64 [2019-03-28 11:59:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.30/7.64 [2019-03-28 11:59:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:50,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core 17.30/7.64 [2019-03-28 11:59:50,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.30/7.64 [2019-03-28 11:59:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.30/7.64 [2019-03-28 11:59:50,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core 17.30/7.64 [2019-03-28 11:59:50,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.30/7.64 [2019-03-28 11:59:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.30/7.64 [2019-03-28 11:59:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.30/7.64 [2019-03-28 11:59:50,237 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 17.30/7.64 [2019-03-28 11:59:50,237 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 17.30/7.64 [2019-03-28 11:59:50,237 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 4 loop predicates 17.30/7.64 [2019-03-28 11:59:50,237 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 4 states. 17.30/7.64 [2019-03-28 11:59:50,337 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 10 states and 11 transitions. Complement of second has 9 states. 17.30/7.64 [2019-03-28 11:59:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 17.30/7.64 [2019-03-28 11:59:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.30/7.64 [2019-03-28 11:59:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:50,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. 17.30/7.64 [2019-03-28 11:59:50,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:50,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. 17.30/7.64 [2019-03-28 11:59:50,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:50,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. 17.30/7.64 [2019-03-28 11:59:50,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.30/7.64 [2019-03-28 11:59:50,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. 17.30/7.64 [2019-03-28 11:59:50,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.30/7.64 [2019-03-28 11:59:50,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.30/7.64 [2019-03-28 11:59:50,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.30/7.64 [2019-03-28 11:59:50,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.30/7.64 [2019-03-28 11:59:50,343 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,343 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,343 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,343 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.30/7.64 [2019-03-28 11:59:50,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.30/7.64 [2019-03-28 11:59:50,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.30/7.64 [2019-03-28 11:59:50,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.30/7.64 [2019-03-28 11:59:50,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:50 BasicIcfg 17.30/7.64 [2019-03-28 11:59:50,350 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.30/7.64 [2019-03-28 11:59:50,350 INFO L168 Benchmark]: Toolchain (without parser) took 3290.85 ms. Allocated memory was 649.6 MB in the beginning and 757.6 MB in the end (delta: 108.0 MB). Free memory was 559.6 MB in the beginning and 627.1 MB in the end (delta: -67.6 MB). Peak memory consumption was 40.4 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,351 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.62 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 559.6 MB in the beginning and 647.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 679.5 MB. Free memory was 647.0 MB in the beginning and 643.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,353 INFO L168 Benchmark]: Boogie Preprocessor took 22.71 ms. Allocated memory is still 679.5 MB. Free memory was 643.9 MB in the beginning and 642.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,353 INFO L168 Benchmark]: RCFGBuilder took 242.93 ms. Allocated memory is still 679.5 MB. Free memory was 642.5 MB in the beginning and 625.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,354 INFO L168 Benchmark]: BlockEncodingV2 took 93.76 ms. Allocated memory is still 679.5 MB. Free memory was 625.5 MB in the beginning and 617.7 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,354 INFO L168 Benchmark]: TraceAbstraction took 1007.56 ms. Allocated memory is still 679.5 MB. Free memory was 617.7 MB in the beginning and 528.7 MB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,355 INFO L168 Benchmark]: BuchiAutomizer took 1570.17 ms. Allocated memory was 679.5 MB in the beginning and 757.6 MB in the end (delta: 78.1 MB). Free memory was 528.7 MB in the beginning and 627.1 MB in the end (delta: -98.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 17.30/7.64 [2019-03-28 11:59:50,359 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.30/7.64 --- Results --- 17.30/7.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.30/7.64 - StatisticsResult: Initial Icfg 17.30/7.64 16 locations, 19 edges 17.30/7.64 - StatisticsResult: Encoded RCFG 17.30/7.64 9 locations, 14 edges 17.30/7.64 * Results from de.uni_freiburg.informatik.ultimate.core: 17.30/7.64 - StatisticsResult: Toolchain Benchmarks 17.30/7.64 Benchmark results are: 17.30/7.64 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.30/7.64 * CACSL2BoogieTranslator took 308.62 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 559.6 MB in the beginning and 647.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 17.30/7.64 * Boogie Procedure Inliner took 38.45 ms. Allocated memory is still 679.5 MB. Free memory was 647.0 MB in the beginning and 643.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.30/7.64 * Boogie Preprocessor took 22.71 ms. Allocated memory is still 679.5 MB. Free memory was 643.9 MB in the beginning and 642.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 17.30/7.64 * RCFGBuilder took 242.93 ms. Allocated memory is still 679.5 MB. Free memory was 642.5 MB in the beginning and 625.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 50.3 GB. 17.30/7.64 * BlockEncodingV2 took 93.76 ms. Allocated memory is still 679.5 MB. Free memory was 625.5 MB in the beginning and 617.7 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 50.3 GB. 17.30/7.64 * TraceAbstraction took 1007.56 ms. Allocated memory is still 679.5 MB. Free memory was 617.7 MB in the beginning and 528.7 MB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 50.3 GB. 17.30/7.64 * BuchiAutomizer took 1570.17 ms. Allocated memory was 679.5 MB in the beginning and 757.6 MB in the end (delta: 78.1 MB). Free memory was 528.7 MB in the beginning and 627.1 MB in the end (delta: -98.4 MB). There was no memory consumed. Max. memory is 50.3 GB. 17.30/7.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 17.30/7.64 - GenericResult: Unfinished Backtranslation 17.30/7.64 unknown boogie variable #length 17.30/7.64 - GenericResult: Unfinished Backtranslation 17.30/7.64 unknown boogie variable #length 17.30/7.64 - GenericResult: Unfinished Backtranslation 17.30/7.64 unknown boogie variable #length 17.30/7.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.30/7.64 - PositiveResult [Line: 20]: pointer dereference always succeeds 17.30/7.64 For all program executions holds that pointer dereference always succeeds at this location 17.30/7.64 - PositiveResult [Line: 20]: pointer dereference always succeeds 17.30/7.64 For all program executions holds that pointer dereference always succeeds at this location 17.30/7.64 - PositiveResult [Line: 23]: pointer dereference always succeeds 17.30/7.64 For all program executions holds that pointer dereference always succeeds at this location 17.30/7.64 - PositiveResult [Line: 23]: pointer dereference always succeeds 17.30/7.64 For all program executions holds that pointer dereference always succeeds at this location 17.30/7.64 - AllSpecificationsHoldResult: All specifications hold 17.30/7.64 4 specifications checked. All of them hold 17.30/7.64 - InvariantResult [Line: 19]: Loop Invariant 17.30/7.64 [2019-03-28 11:59:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 17.30/7.64 [2019-03-28 11:59:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 17.30/7.64 Derived loop invariant: (((a == 0 && 1 <= offset) && 4 * a_length == unknown-#length-unknown[a]) && 1 == \valid[a]) && 0 <= i 17.30/7.64 - StatisticsResult: Ultimate Automizer benchmark data 17.30/7.64 CFG has 1 procedures, 9 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 18 SDslu, 0 SDs, 0 SdLazy, 60 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, 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: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 22 HoareAnnotationTreeSize, 1 FomulaSimplifications, 55 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 741 SizeOfPredicates, 3 NumberOfNonLiveVariables, 34 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 17.30/7.64 - StatisticsResult: Constructed decomposition of program 17.30/7.64 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * i + a_length and consists of 5 locations. One nondeterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 6 locations. 17.30/7.64 - StatisticsResult: Timing statistics 17.30/7.64 BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 65 SDslu, 2 SDs, 0 SdLazy, 50 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf100 lsp94 ukn64 mio100 lsp75 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 17.30/7.64 - TerminationAnalysisResult: Termination proven 17.30/7.64 Buchi Automizer proved that your program is terminating 17.30/7.64 RESULT: Ultimate proved your program to be correct! 17.30/7.64 !SESSION 2019-03-28 11:59:43.764 ----------------------------------------------- 17.30/7.64 eclipse.buildId=unknown 17.30/7.64 java.version=1.8.0_181 17.30/7.64 java.vendor=Oracle Corporation 17.30/7.64 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.30/7.64 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 17.30/7.64 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 17.30/7.64 17.30/7.64 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:59:50.592 17.30/7.64 !MESSAGE The workspace will exit with unsaved changes in this session. 17.30/7.64 Received shutdown request... 17.30/7.64 Ultimate: 17.30/7.64 GTK+ Version Check 17.30/7.64 EOF