18.47/8.51 YES 18.47/8.51 18.47/8.51 Ultimate: Cannot open display: 18.47/8.51 This is Ultimate 0.1.24-8dc7c08-m 18.47/8.51 [2019-03-28 12:46:00,276 INFO L170 SettingsManager]: Resetting all preferences to default values... 18.47/8.51 [2019-03-28 12:46:00,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 18.47/8.51 [2019-03-28 12:46:00,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 18.47/8.51 [2019-03-28 12:46:00,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 18.47/8.51 [2019-03-28 12:46:00,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 18.47/8.51 [2019-03-28 12:46:00,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 18.47/8.51 [2019-03-28 12:46:00,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 18.47/8.51 [2019-03-28 12:46:00,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 18.47/8.51 [2019-03-28 12:46:00,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 18.47/8.51 [2019-03-28 12:46:00,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 18.47/8.51 [2019-03-28 12:46:00,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 18.47/8.51 [2019-03-28 12:46:00,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 18.47/8.51 [2019-03-28 12:46:00,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 18.47/8.51 [2019-03-28 12:46:00,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 18.47/8.51 [2019-03-28 12:46:00,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 18.47/8.51 [2019-03-28 12:46:00,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 18.47/8.51 [2019-03-28 12:46:00,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 18.47/8.51 [2019-03-28 12:46:00,307 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 18.47/8.51 [2019-03-28 12:46:00,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 18.47/8.51 [2019-03-28 12:46:00,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 18.47/8.51 [2019-03-28 12:46:00,312 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 18.47/8.51 [2019-03-28 12:46:00,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 18.47/8.51 [2019-03-28 12:46:00,313 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 18.47/8.51 [2019-03-28 12:46:00,314 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 18.47/8.51 [2019-03-28 12:46:00,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 18.47/8.51 [2019-03-28 12:46:00,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 18.47/8.51 [2019-03-28 12:46:00,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 18.47/8.51 [2019-03-28 12:46:00,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 18.47/8.51 [2019-03-28 12:46:00,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 18.47/8.51 [2019-03-28 12:46:00,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 18.47/8.51 [2019-03-28 12:46:00,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 18.47/8.51 [2019-03-28 12:46:00,319 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 18.47/8.51 [2019-03-28 12:46:00,334 INFO L110 SettingsManager]: Loading preferences was successful 18.47/8.51 [2019-03-28 12:46:00,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 18.47/8.51 [2019-03-28 12:46:00,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 18.47/8.51 [2019-03-28 12:46:00,336 INFO L133 SettingsManager]: * Rewrite not-equals=true 18.47/8.51 [2019-03-28 12:46:00,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 18.47/8.51 [2019-03-28 12:46:00,336 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 18.47/8.51 [2019-03-28 12:46:00,336 INFO L133 SettingsManager]: * Use SBE=true 18.47/8.51 [2019-03-28 12:46:00,336 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 18.47/8.51 [2019-03-28 12:46:00,337 INFO L133 SettingsManager]: * Use old map elimination=false 18.47/8.51 [2019-03-28 12:46:00,337 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 18.47/8.51 [2019-03-28 12:46:00,337 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 18.47/8.51 [2019-03-28 12:46:00,337 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 18.47/8.51 [2019-03-28 12:46:00,337 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 18.47/8.51 [2019-03-28 12:46:00,338 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 18.47/8.51 [2019-03-28 12:46:00,338 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.47/8.51 [2019-03-28 12:46:00,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 18.47/8.51 [2019-03-28 12:46:00,338 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 18.47/8.51 [2019-03-28 12:46:00,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE 18.47/8.51 [2019-03-28 12:46:00,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 18.47/8.51 [2019-03-28 12:46:00,339 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 18.47/8.51 [2019-03-28 12:46:00,339 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 18.47/8.51 [2019-03-28 12:46:00,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 18.47/8.51 [2019-03-28 12:46:00,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 18.47/8.51 [2019-03-28 12:46:00,340 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 18.47/8.51 [2019-03-28 12:46:00,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.47/8.51 [2019-03-28 12:46:00,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 18.47/8.51 [2019-03-28 12:46:00,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 18.47/8.51 [2019-03-28 12:46:00,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 18.47/8.51 [2019-03-28 12:46:00,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 18.47/8.51 [2019-03-28 12:46:00,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 18.47/8.51 [2019-03-28 12:46:00,379 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 18.47/8.51 [2019-03-28 12:46:00,383 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 18.47/8.51 [2019-03-28 12:46:00,384 INFO L271 PluginConnector]: Initializing CDTParser... 18.47/8.51 [2019-03-28 12:46:00,385 INFO L276 PluginConnector]: CDTParser initialized 18.47/8.51 [2019-03-28 12:46:00,385 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 18.47/8.51 [2019-03-28 12:46:00,451 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/77d8bceff01549eb97a71a51ae327cb4/FLAG786e1bd46 18.47/8.51 [2019-03-28 12:46:00,826 INFO L307 CDTParser]: Found 1 translation units. 18.47/8.51 [2019-03-28 12:46:00,827 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 18.47/8.51 [2019-03-28 12:46:00,827 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 18.47/8.51 [2019-03-28 12:46:00,834 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/77d8bceff01549eb97a71a51ae327cb4/FLAG786e1bd46 18.47/8.51 [2019-03-28 12:46:01,221 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/77d8bceff01549eb97a71a51ae327cb4 18.47/8.51 [2019-03-28 12:46:01,233 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 18.47/8.51 [2019-03-28 12:46:01,234 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 18.47/8.51 [2019-03-28 12:46:01,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 18.47/8.51 [2019-03-28 12:46:01,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 18.47/8.51 [2019-03-28 12:46:01,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 18.47/8.51 [2019-03-28 12:46:01,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cfb9783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:01,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 18.47/8.51 [2019-03-28 12:46:01,268 INFO L176 MainTranslator]: Built tables and reachable declarations 18.47/8.51 [2019-03-28 12:46:01,428 INFO L206 PostProcessor]: Analyzing one entry point: main 18.47/8.51 [2019-03-28 12:46:01,441 INFO L191 MainTranslator]: Completed pre-run 18.47/8.51 [2019-03-28 12:46:01,513 INFO L206 PostProcessor]: Analyzing one entry point: main 18.47/8.51 [2019-03-28 12:46:01,529 INFO L195 MainTranslator]: Completed translation 18.47/8.51 [2019-03-28 12:46:01,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01 WrapperNode 18.47/8.51 [2019-03-28 12:46:01,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 18.47/8.51 [2019-03-28 12:46:01,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 18.47/8.51 [2019-03-28 12:46:01,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 18.47/8.51 [2019-03-28 12:46:01,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 18.47/8.51 [2019-03-28 12:46:01,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 18.47/8.51 [2019-03-28 12:46:01,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 18.47/8.51 [2019-03-28 12:46:01,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 18.47/8.51 [2019-03-28 12:46:01,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized 18.47/8.51 [2019-03-28 12:46:01,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 18.47/8.51 [2019-03-28 12:46:01,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 18.47/8.51 [2019-03-28 12:46:01,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... 18.47/8.51 [2019-03-28 12:46:01,596 INFO L276 PluginConnector]: RCFGBuilder initialized 18.47/8.51 [2019-03-28 12:46:01,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 18.47/8.51 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.47/8.51 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 18.47/8.51 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.47/8.51 [2019-03-28 12:46:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 18.47/8.51 [2019-03-28 12:46:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 18.47/8.51 [2019-03-28 12:46:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 18.47/8.51 [2019-03-28 12:46:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 18.47/8.51 [2019-03-28 12:46:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 18.47/8.51 [2019-03-28 12:46:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 18.47/8.51 [2019-03-28 12:46:01,928 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 18.47/8.51 [2019-03-28 12:46:01,928 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 18.47/8.51 [2019-03-28 12:46:01,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:01 BoogieIcfgContainer 18.47/8.51 [2019-03-28 12:46:01,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 18.47/8.51 [2019-03-28 12:46:01,931 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 18.47/8.51 [2019-03-28 12:46:01,931 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 18.47/8.51 [2019-03-28 12:46:01,933 INFO L276 PluginConnector]: BlockEncodingV2 initialized 18.47/8.51 [2019-03-28 12:46:01,934 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:01" (1/1) ... 18.47/8.51 [2019-03-28 12:46:01,950 INFO L313 BlockEncoder]: Initial Icfg 41 locations, 43 edges 18.47/8.51 [2019-03-28 12:46:01,952 INFO L258 BlockEncoder]: Using Remove infeasible edges 18.47/8.51 [2019-03-28 12:46:01,953 INFO L263 BlockEncoder]: Using Maximize final states 18.47/8.51 [2019-03-28 12:46:01,953 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 18.47/8.51 [2019-03-28 12:46:01,954 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 18.47/8.51 [2019-03-28 12:46:01,955 INFO L296 BlockEncoder]: Using Remove sink states 18.47/8.51 [2019-03-28 12:46:01,956 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 18.47/8.51 [2019-03-28 12:46:01,956 INFO L179 BlockEncoder]: Using Rewrite not-equals 18.47/8.51 [2019-03-28 12:46:01,981 INFO L185 BlockEncoder]: Using Use SBE 18.47/8.51 [2019-03-28 12:46:02,017 INFO L200 BlockEncoder]: SBE split 21 edges 18.47/8.51 [2019-03-28 12:46:02,022 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 18.47/8.51 [2019-03-28 12:46:02,024 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.47/8.51 [2019-03-28 12:46:02,044 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 18.47/8.51 [2019-03-28 12:46:02,046 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 18.47/8.51 [2019-03-28 12:46:02,048 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.47/8.51 [2019-03-28 12:46:02,048 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.47/8.51 [2019-03-28 12:46:02,049 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 18.47/8.51 [2019-03-28 12:46:02,050 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.47/8.51 [2019-03-28 12:46:02,050 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 57 edges 18.47/8.51 [2019-03-28 12:46:02,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02 BasicIcfg 18.47/8.51 [2019-03-28 12:46:02,051 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 18.47/8.51 [2019-03-28 12:46:02,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 18.47/8.51 [2019-03-28 12:46:02,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... 18.47/8.51 [2019-03-28 12:46:02,055 INFO L276 PluginConnector]: TraceAbstraction initialized 18.47/8.51 [2019-03-28 12:46:02,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:01" (1/4) ... 18.47/8.51 [2019-03-28 12:46:02,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6ca2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:02, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:02,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (2/4) ... 18.47/8.51 [2019-03-28 12:46:02,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6ca2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:02, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:02,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:01" (3/4) ... 18.47/8.51 [2019-03-28 12:46:02,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6ca2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:02, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:02,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02" (4/4) ... 18.47/8.51 [2019-03-28 12:46:02,059 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.47/8.51 [2019-03-28 12:46:02,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 18.47/8.51 [2019-03-28 12:46:02,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 18.47/8.51 [2019-03-28 12:46:02,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 18.47/8.51 [2019-03-28 12:46:02,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.47/8.51 [2019-03-28 12:46:02,124 INFO L382 AbstractCegarLoop]: Interprodecural is true 18.47/8.51 [2019-03-28 12:46:02,125 INFO L383 AbstractCegarLoop]: Hoare is true 18.47/8.51 [2019-03-28 12:46:02,125 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 18.47/8.51 [2019-03-28 12:46:02,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 18.47/8.51 [2019-03-28 12:46:02,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.47/8.51 [2019-03-28 12:46:02,125 INFO L387 AbstractCegarLoop]: Difference is false 18.47/8.51 [2019-03-28 12:46:02,125 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 18.47/8.51 [2019-03-28 12:46:02,125 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 18.47/8.51 [2019-03-28 12:46:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. 18.47/8.51 [2019-03-28 12:46:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.47/8.51 [2019-03-28 12:46:02,147 INFO L394 BasicCegarLoop]: Found error trace 18.47/8.51 [2019-03-28 12:46:02,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.47/8.51 [2019-03-28 12:46:02,149 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 18.47/8.51 [2019-03-28 12:46:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 114487, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:02,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:02,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:02,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.47/8.51 [2019-03-28 12:46:02,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.47/8.51 [2019-03-28 12:46:02,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.47/8.51 [2019-03-28 12:46:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.47/8.51 [2019-03-28 12:46:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.47/8.51 [2019-03-28 12:46:02,359 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. 18.47/8.51 [2019-03-28 12:46:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.47/8.51 [2019-03-28 12:46:02,501 INFO L93 Difference]: Finished difference Result 34 states and 57 transitions. 18.47/8.51 [2019-03-28 12:46:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.47/8.51 [2019-03-28 12:46:02,517 INFO L225 Difference]: With dead ends: 34 18.47/8.51 [2019-03-28 12:46:02,518 INFO L226 Difference]: Without dead ends: 30 18.47/8.51 [2019-03-28 12:46:02,521 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 18.47/8.51 [2019-03-28 12:46:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 18.47/8.51 [2019-03-28 12:46:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 18.47/8.51 [2019-03-28 12:46:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 18.47/8.51 [2019-03-28 12:46:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. 18.47/8.51 [2019-03-28 12:46:02,561 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. 18.47/8.51 [2019-03-28 12:46:02,562 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. 18.47/8.51 [2019-03-28 12:46:02,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. 18.47/8.51 [2019-03-28 12:46:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.47/8.51 [2019-03-28 12:46:02,563 INFO L394 BasicCegarLoop]: Found error trace 18.47/8.51 [2019-03-28 12:46:02,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.47/8.51 [2019-03-28 12:46:02,563 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 18.47/8.51 [2019-03-28 12:46:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 114489, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:02,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:02,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:02,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.47/8.51 [2019-03-28 12:46:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.47/8.51 [2019-03-28 12:46:02,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.47/8.51 [2019-03-28 12:46:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.47/8.51 [2019-03-28 12:46:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.47/8.51 [2019-03-28 12:46:02,592 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. 18.47/8.51 [2019-03-28 12:46:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.47/8.51 [2019-03-28 12:46:02,680 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. 18.47/8.51 [2019-03-28 12:46:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.47/8.51 [2019-03-28 12:46:02,682 INFO L225 Difference]: With dead ends: 34 18.47/8.51 [2019-03-28 12:46:02,682 INFO L226 Difference]: Without dead ends: 30 18.47/8.51 [2019-03-28 12:46:02,683 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 18.47/8.51 [2019-03-28 12:46:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 18.47/8.51 [2019-03-28 12:46:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 18.47/8.51 [2019-03-28 12:46:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 18.47/8.51 [2019-03-28 12:46:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. 18.47/8.51 [2019-03-28 12:46:02,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 45 transitions. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. 18.47/8.51 [2019-03-28 12:46:02,689 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 45 transitions. 18.47/8.51 [2019-03-28 12:46:02,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 45 transitions. 18.47/8.51 [2019-03-28 12:46:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.47/8.51 [2019-03-28 12:46:02,690 INFO L394 BasicCegarLoop]: Found error trace 18.47/8.51 [2019-03-28 12:46:02,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.47/8.51 [2019-03-28 12:46:02,691 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 18.47/8.51 [2019-03-28 12:46:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 114490, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:02,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:02,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.47/8.51 [2019-03-28 12:46:02,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.47/8.51 [2019-03-28 12:46:02,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.47/8.51 [2019-03-28 12:46:02,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.47/8.51 [2019-03-28 12:46:02,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.47/8.51 [2019-03-28 12:46:02,742 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 3 states. 18.47/8.51 [2019-03-28 12:46:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.47/8.51 [2019-03-28 12:46:02,833 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. 18.47/8.51 [2019-03-28 12:46:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.47/8.51 [2019-03-28 12:46:02,835 INFO L225 Difference]: With dead ends: 30 18.47/8.51 [2019-03-28 12:46:02,835 INFO L226 Difference]: Without dead ends: 26 18.47/8.51 [2019-03-28 12:46:02,835 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 18.47/8.51 [2019-03-28 12:46:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 18.47/8.51 [2019-03-28 12:46:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 18.47/8.51 [2019-03-28 12:46:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 18.47/8.51 [2019-03-28 12:46:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. 18.47/8.51 [2019-03-28 12:46:02,839 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 3 18.47/8.51 [2019-03-28 12:46:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. 18.47/8.51 [2019-03-28 12:46:02,840 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 41 transitions. 18.47/8.51 [2019-03-28 12:46:02,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. 18.47/8.51 [2019-03-28 12:46:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 18.47/8.51 [2019-03-28 12:46:02,840 INFO L394 BasicCegarLoop]: Found error trace 18.47/8.51 [2019-03-28 12:46:02,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:02,841 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 18.47/8.51 [2019-03-28 12:46:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 3547400, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:02,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:02,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:02,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.47/8.51 [2019-03-28 12:46:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.47/8.51 [2019-03-28 12:46:02,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.47/8.51 [2019-03-28 12:46:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.47/8.51 [2019-03-28 12:46:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.47/8.51 [2019-03-28 12:46:02,871 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. Second operand 3 states. 18.47/8.51 [2019-03-28 12:46:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.47/8.51 [2019-03-28 12:46:02,933 INFO L93 Difference]: Finished difference Result 26 states and 41 transitions. 18.47/8.51 [2019-03-28 12:46:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 18.47/8.51 [2019-03-28 12:46:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.47/8.51 [2019-03-28 12:46:02,934 INFO L225 Difference]: With dead ends: 26 18.47/8.51 [2019-03-28 12:46:02,934 INFO L226 Difference]: Without dead ends: 20 18.47/8.51 [2019-03-28 12:46:02,935 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 18.47/8.51 [2019-03-28 12:46:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 18.47/8.51 [2019-03-28 12:46:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 18.47/8.51 [2019-03-28 12:46:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 18.47/8.51 [2019-03-28 12:46:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. 18.47/8.51 [2019-03-28 12:46:02,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 4 18.47/8.51 [2019-03-28 12:46:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. 18.47/8.51 [2019-03-28 12:46:02,939 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. 18.47/8.51 [2019-03-28 12:46:02,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. 18.47/8.51 [2019-03-28 12:46:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 18.47/8.51 [2019-03-28 12:46:02,939 INFO L394 BasicCegarLoop]: Found error trace 18.47/8.51 [2019-03-28 12:46:02,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:02,940 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 18.47/8.51 [2019-03-28 12:46:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 3547402, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:02,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.47/8.51 [2019-03-28 12:46:02,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.47/8.51 [2019-03-28 12:46:02,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.47/8.51 [2019-03-28 12:46:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.47/8.51 [2019-03-28 12:46:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.47/8.51 [2019-03-28 12:46:02,971 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 3 states. 18.47/8.51 [2019-03-28 12:46:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.47/8.51 [2019-03-28 12:46:03,015 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. 18.47/8.51 [2019-03-28 12:46:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:03,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 18.47/8.51 [2019-03-28 12:46:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.47/8.51 [2019-03-28 12:46:03,017 INFO L225 Difference]: With dead ends: 20 18.47/8.51 [2019-03-28 12:46:03,017 INFO L226 Difference]: Without dead ends: 0 18.47/8.51 [2019-03-28 12:46:03,017 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 18.47/8.51 [2019-03-28 12:46:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 18.47/8.51 [2019-03-28 12:46:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 18.47/8.51 [2019-03-28 12:46:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 18.47/8.51 [2019-03-28 12:46:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:03,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 18.47/8.51 [2019-03-28 12:46:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. 18.47/8.51 [2019-03-28 12:46:03,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:03,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.47/8.51 [2019-03-28 12:46:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:03,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 18.47/8.51 [2019-03-28 12:46:03,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:03,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 17) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,058 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 14) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,058 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 18.47/8.51 [2019-03-28 12:46:03,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,058 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 17) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,060 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,061 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 18.47/8.51 [2019-03-28 12:46:03,061 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 18.47/8.51 [2019-03-28 12:46:03,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.51 [2019-03-28 12:46:03,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.51 [2019-03-28 12:46:03,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.51 [2019-03-28 12:46:03,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.51 [2019-03-28 12:46:03,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:03 BasicIcfg 18.47/8.51 [2019-03-28 12:46:03,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 18.47/8.51 [2019-03-28 12:46:03,081 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 18.47/8.51 [2019-03-28 12:46:03,081 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 18.47/8.51 [2019-03-28 12:46:03,085 INFO L276 PluginConnector]: BuchiAutomizer initialized 18.47/8.51 [2019-03-28 12:46:03,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.47/8.51 [2019-03-28 12:46:03,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:01" (1/5) ... 18.47/8.51 [2019-03-28 12:46:03,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64afd23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:03, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:03,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.47/8.51 [2019-03-28 12:46:03,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (2/5) ... 18.47/8.51 [2019-03-28 12:46:03,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64afd23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:03, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:03,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.47/8.51 [2019-03-28 12:46:03,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:01" (3/5) ... 18.47/8.51 [2019-03-28 12:46:03,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64afd23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:03, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:03,088 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.47/8.51 [2019-03-28 12:46:03,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02" (4/5) ... 18.47/8.51 [2019-03-28 12:46:03,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64afd23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:03, skipping insertion in model container 18.47/8.51 [2019-03-28 12:46:03,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.47/8.51 [2019-03-28 12:46:03,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:03" (5/5) ... 18.47/8.51 [2019-03-28 12:46:03,090 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.47/8.51 [2019-03-28 12:46:03,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.47/8.51 [2019-03-28 12:46:03,112 INFO L374 BuchiCegarLoop]: Interprodecural is true 18.47/8.51 [2019-03-28 12:46:03,112 INFO L375 BuchiCegarLoop]: Hoare is true 18.47/8.51 [2019-03-28 12:46:03,112 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 18.47/8.51 [2019-03-28 12:46:03,112 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 18.47/8.51 [2019-03-28 12:46:03,112 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.47/8.51 [2019-03-28 12:46:03,112 INFO L379 BuchiCegarLoop]: Difference is false 18.47/8.51 [2019-03-28 12:46:03,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 18.47/8.51 [2019-03-28 12:46:03,113 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 18.47/8.51 [2019-03-28 12:46:03,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 18.47/8.51 [2019-03-28 12:46:03,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.47/8.51 [2019-03-28 12:46:03,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.47/8.51 [2019-03-28 12:46:03,123 INFO L119 BuchiIsEmpty]: Starting construction of run 18.47/8.51 [2019-03-28 12:46:03,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:03,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:03,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 18.47/8.51 [2019-03-28 12:46:03,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 18.47/8.51 [2019-03-28 12:46:03,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 18.47/8.51 [2019-03-28 12:46:03,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.47/8.51 [2019-03-28 12:46:03,131 INFO L119 BuchiIsEmpty]: Starting construction of run 18.47/8.51 [2019-03-28 12:46:03,131 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:03,132 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 18.47/8.51 [2019-03-28 12:46:03,137 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [84] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [127] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset] 11#L9true [69] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 8#L9-1true [66] L9-1-->L10: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13#L10true [73] L10-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 28#L11true [108] L11-->L15-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 29#L15-4true 18.47/8.51 [2019-03-28 12:46:03,138 INFO L796 eck$LassoCheckResult]: Loop: 29#L15-4true [88] L15-4-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 34#L15-1true [98] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 33#L15-2true [97] L15-2-->L16: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 5#L16true [61] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 4#L16-1true [58] L16-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 18#L16-2true [172] L16-2-->L15-4: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_23 (store (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_23) v_ULTIMATE.start_test_fun_~y_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| |v_ULTIMATE.start_test_fun_#t~mem6_6|))) |v_#memory_int_16|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_17 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_23)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_17) (= 1 (select |v_#valid_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_23))) InVars {#valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_23, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_17, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_23, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_17, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 29#L15-4true 18.47/8.51 [2019-03-28 12:46:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -883206388, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:03,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:03,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -794642951, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:03,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:03,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash -272279356, now seen corresponding path program 1 times 18.47/8.51 [2019-03-28 12:46:03,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.47/8.51 [2019-03-28 12:46:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.47/8.51 [2019-03-28 12:46:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.47/8.51 [2019-03-28 12:46:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:03,560 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 18.47/8.51 [2019-03-28 12:46:03,666 INFO L216 LassoAnalysis]: Preferences: 18.47/8.51 [2019-03-28 12:46:03,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.47/8.51 [2019-03-28 12:46:03,667 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.47/8.51 [2019-03-28 12:46:03,667 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.47/8.51 [2019-03-28 12:46:03,667 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.47/8.51 [2019-03-28 12:46:03,668 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.47/8.51 [2019-03-28 12:46:03,668 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.47/8.51 [2019-03-28 12:46:03,668 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.47/8.51 [2019-03-28 12:46:03,668 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 18.47/8.51 [2019-03-28 12:46:03,668 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.47/8.51 [2019-03-28 12:46:03,668 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.47/8.51 [2019-03-28 12:46:03,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:03,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:03,918 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 18.47/8.51 [2019-03-28 12:46:03,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.47/8.51 [2019-03-28 12:46:04,341 INFO L300 LassoAnalysis]: Preprocessing complete. 18.47/8.51 [2019-03-28 12:46:04,347 INFO L497 LassoAnalysis]: Using template 'affine'. 18.47/8.51 [2019-03-28 12:46:04,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.47/8.51 Termination analysis: LINEAR_WITH_GUESSES 18.47/8.51 Number of strict supporting invariants: 0 18.47/8.51 Number of non-strict supporting invariants: 1 18.47/8.51 Consider only non-deceasing supporting invariants: true 18.47/8.51 Simplify termination arguments: true 18.47/8.51 Simplify supporting invariants: trueOverapproximate stem: false 18.47/8.51 [2019-03-28 12:46:04,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.47/8.51 [2019-03-28 12:46:04,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.47/8.51 [2019-03-28 12:46:04,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.47/8.51 [2019-03-28 12:46:04,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.47/8.51 [2019-03-28 12:46:04,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.47/8.51 [2019-03-28 12:46:04,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.47/8.51 [2019-03-28 12:46:04,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.47/8.51 [2019-03-28 12:46:04,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.47/8.51 [2019-03-28 12:46:04,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.47/8.51 Termination analysis: LINEAR_WITH_GUESSES 18.47/8.51 Number of strict supporting invariants: 0 18.47/8.51 Number of non-strict supporting invariants: 1 18.47/8.51 Consider only non-deceasing supporting invariants: true 18.47/8.51 Simplify termination arguments: true 18.47/8.51 Simplify supporting invariants: trueOverapproximate stem: false 18.47/8.51 [2019-03-28 12:46:04,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.47/8.51 [2019-03-28 12:46:04,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.47/8.51 [2019-03-28 12:46:04,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.47/8.51 [2019-03-28 12:46:04,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.47/8.51 [2019-03-28 12:46:04,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.47/8.51 [2019-03-28 12:46:04,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.47/8.51 [2019-03-28 12:46:04,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.47/8.51 [2019-03-28 12:46:04,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.47/8.51 Termination analysis: LINEAR_WITH_GUESSES 18.47/8.51 Number of strict supporting invariants: 0 18.47/8.51 Number of non-strict supporting invariants: 1 18.47/8.51 Consider only non-deceasing supporting invariants: true 18.47/8.51 Simplify termination arguments: true 18.47/8.51 Simplify supporting invariants: trueOverapproximate stem: false 18.47/8.51 [2019-03-28 12:46:04,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.47/8.51 [2019-03-28 12:46:04,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.47/8.51 [2019-03-28 12:46:04,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.47/8.51 [2019-03-28 12:46:04,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.47/8.51 [2019-03-28 12:46:04,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.47/8.51 [2019-03-28 12:46:04,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.47/8.51 [2019-03-28 12:46:04,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.47/8.51 [2019-03-28 12:46:04,434 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 18.47/8.51 [2019-03-28 12:46:04,434 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 18.47/8.51 [2019-03-28 12:46:04,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.47/8.51 [2019-03-28 12:46:04,439 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 18.47/8.51 [2019-03-28 12:46:04,439 INFO L518 LassoAnalysis]: Proved termination. 18.47/8.51 [2019-03-28 12:46:04,440 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.47/8.51 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 18.47/8.51 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1 >= 0] 18.47/8.51 [2019-03-28 12:46:04,476 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed 18.47/8.51 [2019-03-28 12:46:04,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 18.47/8.51 [2019-03-28 12:46:04,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 18.47/8.51 [2019-03-28 12:46:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.47/8.51 [2019-03-28 12:46:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:04,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core 18.47/8.51 [2019-03-28 12:46:04,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.47/8.51 [2019-03-28 12:46:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.47/8.51 [2019-03-28 12:46:04,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core 18.47/8.51 [2019-03-28 12:46:04,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.47/8.51 [2019-03-28 12:46:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.47/8.51 [2019-03-28 12:46:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:04,830 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 18.47/8.51 [2019-03-28 12:46:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:04,841 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 18.47/8.51 [2019-03-28 12:46:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.47/8.51 [2019-03-28 12:46:04,849 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 18.47/8.51 [2019-03-28 12:46:04,850 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 18.47/8.51 [2019-03-28 12:46:04,853 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates 18.47/8.51 [2019-03-28 12:46:04,854 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states. Second operand 8 states. 18.47/8.51 [2019-03-28 12:46:05,144 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states.. Second operand 8 states. Result 53 states and 97 transitions. Complement of second has 15 states. 18.47/8.51 [2019-03-28 12:46:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states 18.47/8.51 [2019-03-28 12:46:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 18.47/8.51 [2019-03-28 12:46:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. 18.47/8.51 [2019-03-28 12:46:05,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 6 letters. Loop has 6 letters. 18.47/8.51 [2019-03-28 12:46:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.47/8.51 [2019-03-28 12:46:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 12 letters. Loop has 6 letters. 18.47/8.51 [2019-03-28 12:46:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.47/8.51 [2019-03-28 12:46:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 6 letters. Loop has 12 letters. 18.47/8.51 [2019-03-28 12:46:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.47/8.51 [2019-03-28 12:46:05,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 97 transitions. 18.47/8.51 [2019-03-28 12:46:05,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.47/8.51 [2019-03-28 12:46:05,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 18.47/8.51 [2019-03-28 12:46:05,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 18.47/8.51 [2019-03-28 12:46:05,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.47/8.51 [2019-03-28 12:46:05,166 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,166 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,166 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,167 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 18.47/8.51 [2019-03-28 12:46:05,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 18.47/8.51 [2019-03-28 12:46:05,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.47/8.51 [2019-03-28 12:46:05,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 18.47/8.51 [2019-03-28 12:46:05,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:05 BasicIcfg 18.47/8.51 [2019-03-28 12:46:05,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 18.47/8.51 [2019-03-28 12:46:05,173 INFO L168 Benchmark]: Toolchain (without parser) took 3940.09 ms. Allocated memory was 649.6 MB in the beginning and 752.4 MB in the end (delta: 102.8 MB). Free memory was 563.9 MB in the beginning and 494.9 MB in the end (delta: 69.0 MB). Peak memory consumption was 171.7 MB. Max. memory is 50.3 GB. 18.47/8.51 [2019-03-28 12:46:05,175 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.47/8.51 [2019-03-28 12:46:05,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.91 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 563.9 MB in the beginning and 649.2 MB in the end (delta: -85.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 18.47/8.51 [2019-03-28 12:46:05,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 681.6 MB. Free memory was 649.2 MB in the beginning and 644.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 18.47/8.51 [2019-03-28 12:46:05,176 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 681.6 MB. Free memory was 644.7 MB in the beginning and 643.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.47/8.52 [2019-03-28 12:46:05,177 INFO L168 Benchmark]: RCFGBuilder took 334.41 ms. Allocated memory is still 681.6 MB. Free memory was 643.4 MB in the beginning and 619.9 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 18.47/8.52 [2019-03-28 12:46:05,178 INFO L168 Benchmark]: BlockEncodingV2 took 120.15 ms. Allocated memory is still 681.6 MB. Free memory was 619.9 MB in the beginning and 610.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 18.47/8.52 [2019-03-28 12:46:05,178 INFO L168 Benchmark]: TraceAbstraction took 1029.25 ms. Allocated memory is still 681.6 MB. Free memory was 610.5 MB in the beginning and 512.4 MB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 50.3 GB. 18.47/8.52 [2019-03-28 12:46:05,179 INFO L168 Benchmark]: BuchiAutomizer took 2091.54 ms. Allocated memory was 681.6 MB in the beginning and 752.4 MB in the end (delta: 70.8 MB). Free memory was 512.4 MB in the beginning and 494.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 88.3 MB. Max. memory is 50.3 GB. 18.47/8.52 [2019-03-28 12:46:05,183 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 18.47/8.52 --- Results --- 18.47/8.52 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 18.47/8.52 - StatisticsResult: Initial Icfg 18.47/8.52 41 locations, 43 edges 18.47/8.52 - StatisticsResult: Encoded RCFG 18.47/8.52 34 locations, 57 edges 18.47/8.52 * Results from de.uni_freiburg.informatik.ultimate.core: 18.47/8.52 - StatisticsResult: Toolchain Benchmarks 18.47/8.52 Benchmark results are: 18.47/8.52 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.47/8.52 * CACSL2BoogieTranslator took 294.91 ms. Allocated memory was 649.6 MB in the beginning and 681.6 MB in the end (delta: 32.0 MB). Free memory was 563.9 MB in the beginning and 649.2 MB in the end (delta: -85.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 18.47/8.52 * Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 681.6 MB. Free memory was 649.2 MB in the beginning and 644.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 18.47/8.52 * Boogie Preprocessor took 23.83 ms. Allocated memory is still 681.6 MB. Free memory was 644.7 MB in the beginning and 643.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 18.47/8.52 * RCFGBuilder took 334.41 ms. Allocated memory is still 681.6 MB. Free memory was 643.4 MB in the beginning and 619.9 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 18.47/8.52 * BlockEncodingV2 took 120.15 ms. Allocated memory is still 681.6 MB. Free memory was 619.9 MB in the beginning and 610.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 18.47/8.52 * TraceAbstraction took 1029.25 ms. Allocated memory is still 681.6 MB. Free memory was 610.5 MB in the beginning and 512.4 MB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 50.3 GB. 18.47/8.52 * BuchiAutomizer took 2091.54 ms. Allocated memory was 681.6 MB in the beginning and 752.4 MB in the end (delta: 70.8 MB). Free memory was 512.4 MB in the beginning and 494.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 88.3 MB. Max. memory is 50.3 GB. 18.47/8.52 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #length 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #length 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #length 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #length 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #memory_int 18.47/8.52 - GenericResult: Unfinished Backtranslation 18.47/8.52 unknown boogie variable #memory_int 18.47/8.52 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 18.47/8.52 - PositiveResult [Line: 15]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 18]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 15]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 15]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 9]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 15]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 9]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 10]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 10]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 11]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 11]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 18]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.47/8.52 For all program executions holds that pointer dereference always succeeds at this location 18.47/8.52 - AllSpecificationsHoldResult: All specifications hold 18.47/8.52 20 specifications checked. All of them hold 18.47/8.52 - InvariantResult [Line: 15]: Loop Invariant 18.47/8.52 [2019-03-28 12:46:05,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.52 [2019-03-28 12:46:05,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.52 [2019-03-28 12:46:05,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.52 [2019-03-28 12:46:05,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.47/8.52 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 18.47/8.52 - StatisticsResult: Ultimate Automizer benchmark data 18.47/8.52 CFG has 1 procedures, 34 locations, 20 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 154 SDslu, 3 SDs, 0 SdLazy, 164 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 18.47/8.52 - StatisticsResult: Constructed decomposition of program 18.47/8.52 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. 18.47/8.52 - StatisticsResult: Timing statistics 18.47/8.52 BüchiAutomizer plugin needed 2.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 143 SDslu, 27 SDs, 0 SdLazy, 285 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax100 hnf100 lsp96 ukn72 mio100 lsp38 div100 bol100 ite100 ukn100 eq175 hnf89 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 18.47/8.52 - TerminationAnalysisResult: Termination proven 18.47/8.52 Buchi Automizer proved that your program is terminating 18.47/8.52 RESULT: Ultimate proved your program to be correct! 18.47/8.52 !SESSION 2019-03-28 12:45:57.907 ----------------------------------------------- 18.47/8.52 eclipse.buildId=unknown 18.47/8.52 java.version=1.8.0_181 18.47/8.52 java.vendor=Oracle Corporation 18.47/8.52 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 18.47/8.52 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.47/8.52 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.47/8.52 18.47/8.52 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:05.419 18.47/8.52 !MESSAGE The workspace will exit with unsaved changes in this session. 18.47/8.52 Received shutdown request... 18.47/8.52 Ultimate: 18.47/8.52 GTK+ Version Check 18.47/8.52 EOF