32.34/22.68 YES 32.34/22.68 32.34/22.68 Ultimate: Cannot open display: 32.34/22.68 This is Ultimate 0.1.24-8dc7c08-m 32.34/22.68 [2019-03-28 12:39:00,115 INFO L170 SettingsManager]: Resetting all preferences to default values... 32.34/22.68 [2019-03-28 12:39:00,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 32.34/22.68 [2019-03-28 12:39:00,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 32.34/22.68 [2019-03-28 12:39:00,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 32.34/22.68 [2019-03-28 12:39:00,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 32.34/22.68 [2019-03-28 12:39:00,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 32.34/22.68 [2019-03-28 12:39:00,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 32.34/22.68 [2019-03-28 12:39:00,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 32.34/22.68 [2019-03-28 12:39:00,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 32.34/22.68 [2019-03-28 12:39:00,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 32.34/22.68 [2019-03-28 12:39:00,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 32.34/22.68 [2019-03-28 12:39:00,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 32.34/22.68 [2019-03-28 12:39:00,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 32.34/22.68 [2019-03-28 12:39:00,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 32.34/22.68 [2019-03-28 12:39:00,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 32.34/22.68 [2019-03-28 12:39:00,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 32.34/22.68 [2019-03-28 12:39:00,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 32.34/22.68 [2019-03-28 12:39:00,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 32.34/22.68 [2019-03-28 12:39:00,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 32.34/22.68 [2019-03-28 12:39:00,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 32.34/22.68 [2019-03-28 12:39:00,150 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 32.34/22.68 [2019-03-28 12:39:00,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 32.34/22.68 [2019-03-28 12:39:00,152 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 32.34/22.68 [2019-03-28 12:39:00,153 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 32.34/22.68 [2019-03-28 12:39:00,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 32.34/22.68 [2019-03-28 12:39:00,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 32.34/22.68 [2019-03-28 12:39:00,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 32.34/22.68 [2019-03-28 12:39:00,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 32.34/22.68 [2019-03-28 12:39:00,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 32.34/22.68 [2019-03-28 12:39:00,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 32.34/22.68 [2019-03-28 12:39:00,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 32.34/22.68 [2019-03-28 12:39:00,158 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 32.34/22.68 [2019-03-28 12:39:00,172 INFO L110 SettingsManager]: Loading preferences was successful 32.34/22.68 [2019-03-28 12:39:00,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 32.34/22.68 [2019-03-28 12:39:00,174 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 32.34/22.68 [2019-03-28 12:39:00,174 INFO L133 SettingsManager]: * Rewrite not-equals=true 32.34/22.68 [2019-03-28 12:39:00,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 32.34/22.68 [2019-03-28 12:39:00,174 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 32.34/22.68 [2019-03-28 12:39:00,174 INFO L133 SettingsManager]: * Use SBE=true 32.34/22.68 [2019-03-28 12:39:00,175 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 32.34/22.68 [2019-03-28 12:39:00,175 INFO L133 SettingsManager]: * Use old map elimination=false 32.34/22.68 [2019-03-28 12:39:00,175 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 32.34/22.68 [2019-03-28 12:39:00,175 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 32.34/22.68 [2019-03-28 12:39:00,175 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 32.34/22.68 [2019-03-28 12:39:00,176 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 32.34/22.68 [2019-03-28 12:39:00,176 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 32.34/22.68 [2019-03-28 12:39:00,176 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.34/22.68 [2019-03-28 12:39:00,176 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 32.34/22.68 [2019-03-28 12:39:00,176 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 32.34/22.68 [2019-03-28 12:39:00,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE 32.34/22.68 [2019-03-28 12:39:00,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 32.34/22.68 [2019-03-28 12:39:00,177 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 32.34/22.68 [2019-03-28 12:39:00,177 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 32.34/22.68 [2019-03-28 12:39:00,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 32.34/22.68 [2019-03-28 12:39:00,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 32.34/22.68 [2019-03-28 12:39:00,178 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 32.34/22.68 [2019-03-28 12:39:00,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 32.34/22.68 [2019-03-28 12:39:00,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 32.34/22.68 [2019-03-28 12:39:00,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 32.34/22.68 [2019-03-28 12:39:00,178 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 32.34/22.68 [2019-03-28 12:39:00,178 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 32.34/22.68 [2019-03-28 12:39:00,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 32.34/22.68 [2019-03-28 12:39:00,219 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 32.34/22.68 [2019-03-28 12:39:00,223 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 32.34/22.68 [2019-03-28 12:39:00,224 INFO L271 PluginConnector]: Initializing CDTParser... 32.34/22.68 [2019-03-28 12:39:00,225 INFO L276 PluginConnector]: CDTParser initialized 32.34/22.68 [2019-03-28 12:39:00,225 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 32.34/22.68 [2019-03-28 12:39:00,293 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/beb1579684364525a272478b8ca80a45/FLAGb91b49f9f 32.34/22.68 [2019-03-28 12:39:00,639 INFO L307 CDTParser]: Found 1 translation units. 32.34/22.68 [2019-03-28 12:39:00,639 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 32.34/22.68 [2019-03-28 12:39:00,640 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 32.34/22.68 [2019-03-28 12:39:00,646 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/beb1579684364525a272478b8ca80a45/FLAGb91b49f9f 32.34/22.68 [2019-03-28 12:39:01,189 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/beb1579684364525a272478b8ca80a45 32.34/22.68 [2019-03-28 12:39:01,201 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 32.34/22.68 [2019-03-28 12:39:01,202 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 32.34/22.68 [2019-03-28 12:39:01,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 32.34/22.68 [2019-03-28 12:39:01,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 32.34/22.68 [2019-03-28 12:39:01,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 32.34/22.68 [2019-03-28 12:39:01,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525b0348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:01,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 32.34/22.68 [2019-03-28 12:39:01,238 INFO L176 MainTranslator]: Built tables and reachable declarations 32.34/22.68 [2019-03-28 12:39:01,403 INFO L206 PostProcessor]: Analyzing one entry point: main 32.34/22.68 [2019-03-28 12:39:01,417 INFO L191 MainTranslator]: Completed pre-run 32.34/22.68 [2019-03-28 12:39:01,434 INFO L206 PostProcessor]: Analyzing one entry point: main 32.34/22.68 [2019-03-28 12:39:01,512 INFO L195 MainTranslator]: Completed translation 32.34/22.68 [2019-03-28 12:39:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01 WrapperNode 32.34/22.68 [2019-03-28 12:39:01,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 32.34/22.68 [2019-03-28 12:39:01,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 32.34/22.68 [2019-03-28 12:39:01,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 32.34/22.68 [2019-03-28 12:39:01,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 32.34/22.68 [2019-03-28 12:39:01,524 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:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,532 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:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 32.34/22.68 [2019-03-28 12:39:01,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 32.34/22.68 [2019-03-28 12:39:01,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 32.34/22.68 [2019-03-28 12:39:01,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized 32.34/22.68 [2019-03-28 12:39:01,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 32.34/22.68 [2019-03-28 12:39:01,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 32.34/22.68 [2019-03-28 12:39:01,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... 32.34/22.68 [2019-03-28 12:39:01,577 INFO L276 PluginConnector]: RCFGBuilder initialized 32.34/22.68 [2019-03-28 12:39:01,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (1/1) ... 32.34/22.68 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.34/22.68 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 32.34/22.68 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 32.34/22.68 [2019-03-28 12:39:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 32.34/22.68 [2019-03-28 12:39:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 32.34/22.68 [2019-03-28 12:39:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 32.34/22.68 [2019-03-28 12:39:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 32.34/22.68 [2019-03-28 12:39:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 32.34/22.68 [2019-03-28 12:39:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 32.34/22.68 [2019-03-28 12:39:01,867 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 32.34/22.68 [2019-03-28 12:39:01,867 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 32.34/22.68 [2019-03-28 12:39:01,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:01 BoogieIcfgContainer 32.34/22.68 [2019-03-28 12:39:01,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 32.34/22.68 [2019-03-28 12:39:01,869 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 32.34/22.68 [2019-03-28 12:39:01,869 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 32.34/22.68 [2019-03-28 12:39:01,872 INFO L276 PluginConnector]: BlockEncodingV2 initialized 32.34/22.68 [2019-03-28 12:39:01,872 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:01" (1/1) ... 32.34/22.68 [2019-03-28 12:39:01,888 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 38 edges 32.34/22.68 [2019-03-28 12:39:01,890 INFO L258 BlockEncoder]: Using Remove infeasible edges 32.34/22.68 [2019-03-28 12:39:01,891 INFO L263 BlockEncoder]: Using Maximize final states 32.34/22.68 [2019-03-28 12:39:01,891 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 32.34/22.68 [2019-03-28 12:39:01,892 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 32.34/22.68 [2019-03-28 12:39:01,893 INFO L296 BlockEncoder]: Using Remove sink states 32.34/22.68 [2019-03-28 12:39:01,894 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 32.34/22.68 [2019-03-28 12:39:01,895 INFO L179 BlockEncoder]: Using Rewrite not-equals 32.34/22.68 [2019-03-28 12:39:01,917 INFO L185 BlockEncoder]: Using Use SBE 32.34/22.68 [2019-03-28 12:39:01,946 INFO L200 BlockEncoder]: SBE split 17 edges 32.34/22.68 [2019-03-28 12:39:01,954 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 32.34/22.68 [2019-03-28 12:39:01,956 INFO L71 MaximizeFinalStates]: 0 new accepting states 32.34/22.68 [2019-03-28 12:39:01,988 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 32.34/22.68 [2019-03-28 12:39:01,991 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 32.34/22.68 [2019-03-28 12:39:01,993 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 32.34/22.68 [2019-03-28 12:39:01,993 INFO L71 MaximizeFinalStates]: 0 new accepting states 32.34/22.68 [2019-03-28 12:39:01,994 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 32.34/22.68 [2019-03-28 12:39:01,995 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 32.34/22.68 [2019-03-28 12:39:01,995 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 47 edges 32.34/22.68 [2019-03-28 12:39:01,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:01 BasicIcfg 32.34/22.68 [2019-03-28 12:39:01,996 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 32.34/22.68 [2019-03-28 12:39:01,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 32.34/22.68 [2019-03-28 12:39:01,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... 32.34/22.68 [2019-03-28 12:39:02,000 INFO L276 PluginConnector]: TraceAbstraction initialized 32.34/22.68 [2019-03-28 12:39:02,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:39:01" (1/4) ... 32.34/22.68 [2019-03-28 12:39:02,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b107af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (2/4) ... 32.34/22.68 [2019-03-28 12:39:02,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b107af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:01" (3/4) ... 32.34/22.68 [2019-03-28 12:39:02,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b107af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:01" (4/4) ... 32.34/22.68 [2019-03-28 12:39:02,004 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 32.34/22.68 [2019-03-28 12:39:02,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 32.34/22.68 [2019-03-28 12:39:02,023 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. 32.34/22.68 [2019-03-28 12:39:02,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. 32.34/22.68 [2019-03-28 12:39:02,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation 32.34/22.68 [2019-03-28 12:39:02,070 INFO L382 AbstractCegarLoop]: Interprodecural is true 32.34/22.68 [2019-03-28 12:39:02,070 INFO L383 AbstractCegarLoop]: Hoare is true 32.34/22.68 [2019-03-28 12:39:02,070 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 32.34/22.68 [2019-03-28 12:39:02,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 32.34/22.68 [2019-03-28 12:39:02,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 32.34/22.68 [2019-03-28 12:39:02,070 INFO L387 AbstractCegarLoop]: Difference is false 32.34/22.68 [2019-03-28 12:39:02,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 32.34/22.68 [2019-03-28 12:39:02,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 32.34/22.68 [2019-03-28 12:39:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. 32.34/22.68 [2019-03-28 12:39:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 32.34/22.68 [2019-03-28 12:39:02,093 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 115897, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,301 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,418 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. 32.34/22.68 [2019-03-28 12:39:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,434 INFO L225 Difference]: With dead ends: 28 32.34/22.68 [2019-03-28 12:39:02,434 INFO L226 Difference]: Without dead ends: 24 32.34/22.68 [2019-03-28 12:39:02,437 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 32.34/22.68 [2019-03-28 12:39:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 32.34/22.68 [2019-03-28 12:39:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 32.34/22.68 [2019-03-28 12:39:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 32.34/22.68 [2019-03-28 12:39:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. 32.34/22.68 [2019-03-28 12:39:02,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. 32.34/22.68 [2019-03-28 12:39:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. 32.34/22.68 [2019-03-28 12:39:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 32.34/22.68 [2019-03-28 12:39:02,478 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 115899, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,504 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,572 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. 32.34/22.68 [2019-03-28 12:39:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,588 INFO L225 Difference]: With dead ends: 28 32.34/22.68 [2019-03-28 12:39:02,588 INFO L226 Difference]: Without dead ends: 24 32.34/22.68 [2019-03-28 12:39:02,590 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 32.34/22.68 [2019-03-28 12:39:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 32.34/22.68 [2019-03-28 12:39:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 32.34/22.68 [2019-03-28 12:39:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 32.34/22.68 [2019-03-28 12:39:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. 32.34/22.68 [2019-03-28 12:39:02,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,595 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. 32.34/22.68 [2019-03-28 12:39:02,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. 32.34/22.68 [2019-03-28 12:39:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 32.34/22.68 [2019-03-28 12:39:02,595 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,596 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 115900, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,637 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,696 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. 32.34/22.68 [2019-03-28 12:39:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,698 INFO L225 Difference]: With dead ends: 24 32.34/22.68 [2019-03-28 12:39:02,698 INFO L226 Difference]: Without dead ends: 20 32.34/22.68 [2019-03-28 12:39:02,699 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 32.34/22.68 [2019-03-28 12:39:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 32.34/22.68 [2019-03-28 12:39:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 32.34/22.68 [2019-03-28 12:39:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 32.34/22.68 [2019-03-28 12:39:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. 32.34/22.68 [2019-03-28 12:39:02,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 3 32.34/22.68 [2019-03-28 12:39:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. 32.34/22.68 [2019-03-28 12:39:02,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. 32.34/22.68 [2019-03-28 12:39:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 32.34/22.68 [2019-03-28 12:39:02,704 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,704 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 3591156, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,733 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,787 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. 32.34/22.68 [2019-03-28 12:39:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,790 INFO L225 Difference]: With dead ends: 20 32.34/22.68 [2019-03-28 12:39:02,790 INFO L226 Difference]: Without dead ends: 16 32.34/22.68 [2019-03-28 12:39:02,790 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 32.34/22.68 [2019-03-28 12:39:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 32.34/22.68 [2019-03-28 12:39:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 32.34/22.68 [2019-03-28 12:39:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 32.34/22.68 [2019-03-28 12:39:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. 32.34/22.68 [2019-03-28 12:39:02,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,794 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. 32.34/22.68 [2019-03-28 12:39:02,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. 32.34/22.68 [2019-03-28 12:39:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 32.34/22.68 [2019-03-28 12:39:02,794 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,795 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 3591158, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,822 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,852 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. 32.34/22.68 [2019-03-28 12:39:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,853 INFO L225 Difference]: With dead ends: 20 32.34/22.68 [2019-03-28 12:39:02,853 INFO L226 Difference]: Without dead ends: 16 32.34/22.68 [2019-03-28 12:39:02,854 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 32.34/22.68 [2019-03-28 12:39:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 32.34/22.68 [2019-03-28 12:39:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 32.34/22.68 [2019-03-28 12:39:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 32.34/22.68 [2019-03-28 12:39:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. 32.34/22.68 [2019-03-28 12:39:02,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. 32.34/22.68 [2019-03-28 12:39:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. 32.34/22.68 [2019-03-28 12:39:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 32.34/22.68 [2019-03-28 12:39:02,858 INFO L394 BasicCegarLoop]: Found error trace 32.34/22.68 [2019-03-28 12:39:02,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:02,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 32.34/22.68 [2019-03-28 12:39:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash 3591159, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:02,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:02,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:02,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.34/22.68 [2019-03-28 12:39:02,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.34/22.68 [2019-03-28 12:39:02,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 32.34/22.68 [2019-03-28 12:39:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.34/22.68 [2019-03-28 12:39:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.34/22.68 [2019-03-28 12:39:02,890 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. 32.34/22.68 [2019-03-28 12:39:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.34/22.68 [2019-03-28 12:39:02,920 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. 32.34/22.68 [2019-03-28 12:39:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 32.34/22.68 [2019-03-28 12:39:02,921 INFO L225 Difference]: With dead ends: 16 32.34/22.68 [2019-03-28 12:39:02,921 INFO L226 Difference]: Without dead ends: 0 32.34/22.68 [2019-03-28 12:39:02,922 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 32.34/22.68 [2019-03-28 12:39:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 32.34/22.68 [2019-03-28 12:39:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 32.34/22.68 [2019-03-28 12:39:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 32.34/22.68 [2019-03-28 12:39:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:02,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 32.34/22.68 [2019-03-28 12:39:02,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:02,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,952 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,953 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,954 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,954 INFO L444 ceAbstractionStarter]: At program point L9-1(lines 8 13) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= ULTIMATE.start_main_~c~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base))) 32.34/22.68 [2019-03-28 12:39:02,954 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,954 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 9 13) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,954 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,955 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 32.34/22.68 [2019-03-28 12:39:02,956 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 32.34/22.68 [2019-03-28 12:39:02,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:02,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:02,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:02,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:02,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:02 BasicIcfg 32.34/22.68 [2019-03-28 12:39:02,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 32.34/22.68 [2019-03-28 12:39:02,974 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 32.34/22.68 [2019-03-28 12:39:02,974 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 32.34/22.68 [2019-03-28 12:39:02,977 INFO L276 PluginConnector]: BuchiAutomizer initialized 32.34/22.68 [2019-03-28 12:39:02,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.34/22.68 [2019-03-28 12:39:02,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:39:01" (1/5) ... 32.34/22.68 [2019-03-28 12:39:02,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c9534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.34/22.68 [2019-03-28 12:39:02,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:01" (2/5) ... 32.34/22.68 [2019-03-28 12:39:02,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c9534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.34/22.68 [2019-03-28 12:39:02,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:01" (3/5) ... 32.34/22.68 [2019-03-28 12:39:02,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c9534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.34/22.68 [2019-03-28 12:39:02,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:01" (4/5) ... 32.34/22.68 [2019-03-28 12:39:02,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c9534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:02, skipping insertion in model container 32.34/22.68 [2019-03-28 12:39:02,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.34/22.68 [2019-03-28 12:39:02,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:02" (5/5) ... 32.34/22.68 [2019-03-28 12:39:02,982 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 32.34/22.68 [2019-03-28 12:39:03,003 INFO L133 ementStrategyFactory]: Using default assertion order modulation 32.34/22.68 [2019-03-28 12:39:03,003 INFO L374 BuchiCegarLoop]: Interprodecural is true 32.34/22.68 [2019-03-28 12:39:03,003 INFO L375 BuchiCegarLoop]: Hoare is true 32.34/22.68 [2019-03-28 12:39:03,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 32.34/22.68 [2019-03-28 12:39:03,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 32.34/22.68 [2019-03-28 12:39:03,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 32.34/22.68 [2019-03-28 12:39:03,004 INFO L379 BuchiCegarLoop]: Difference is false 32.34/22.68 [2019-03-28 12:39:03,004 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 32.34/22.68 [2019-03-28 12:39:03,004 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 32.34/22.68 [2019-03-28 12:39:03,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 32.34/22.68 [2019-03-28 12:39:03,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 32.34/22.68 [2019-03-28 12:39:03,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.34/22.68 [2019-03-28 12:39:03,013 INFO L119 BuchiIsEmpty]: Starting construction of run 32.34/22.68 [2019-03-28 12:39:03,018 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:03,018 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:03,018 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 32.34/22.68 [2019-03-28 12:39:03,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 32.34/22.68 [2019-03-28 12:39:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 32.34/22.68 [2019-03-28 12:39:03,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.34/22.68 [2019-03-28 12:39:03,020 INFO L119 BuchiIsEmpty]: Starting construction of run 32.34/22.68 [2019-03-28 12:39:03,021 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:03,021 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 32.34/22.68 [2019-03-28 12:39:03,026 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [86] 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] 11#L-1true [111] L-1-->L7: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 4#L7true [55] L7-->L7-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~i~0.base_4)) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~i~0.base_4)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0)))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3#L7-1true [52] L7-1-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~c~0.base_4)) (= (select |v_#valid_8| v_ULTIMATE.start_main_~c~0.base_4) 1) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 7#L9-1true 32.34/22.68 [2019-03-28 12:39:03,027 INFO L796 eck$LassoCheckResult]: Loop: 7#L9-1true [63] L9-1-->L10: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12#L10true [69] L10-->L10-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7) 1) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 24#L10-1true [99] L10-1-->L11: Formula: (>= 10 |v_ULTIMATE.start_main_#t~mem2_6|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 29#L11true [145] L11-->L11-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~i~0.base_16)) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_21| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 10#L11-2true [148] L11-2-->L12: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_17|) (= (select |v_#valid_32| v_ULTIMATE.start_main_~i~0.base_17) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13) (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_17))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_17|, #length=|v_#length_24|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 16#L12true [149] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~c~0.base_19)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_15) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_19) v_ULTIMATE.start_main_~c~0.offset_15)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_main_~c~0.base_19))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 14#L12-2true [150] L12-2-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_26| v_ULTIMATE.start_main_~c~0.base_20)) (= (select |v_#valid_34| v_ULTIMATE.start_main_~c~0.base_20) 1) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20) v_ULTIMATE.start_main_~c~0.offset_16 (+ |v_ULTIMATE.start_main_#t~post6_7| 1))) |v_#memory_int_20|)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, #length=|v_#length_26|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post6] 7#L9-1true 32.34/22.68 [2019-03-28 12:39:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash 3593975, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:03,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:03,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -402693216, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:03,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1827466218, now seen corresponding path program 1 times 32.34/22.68 [2019-03-28 12:39:03,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.34/22.68 [2019-03-28 12:39:03,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.34/22.68 [2019-03-28 12:39:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.34/22.68 [2019-03-28 12:39:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:03,401 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 32.34/22.68 [2019-03-28 12:39:03,503 INFO L216 LassoAnalysis]: Preferences: 32.34/22.68 [2019-03-28 12:39:03,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.34/22.68 [2019-03-28 12:39:03,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.34/22.68 [2019-03-28 12:39:03,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.34/22.68 [2019-03-28 12:39:03,505 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.34/22.68 [2019-03-28 12:39:03,505 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.34/22.68 [2019-03-28 12:39:03,505 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.34/22.68 [2019-03-28 12:39:03,506 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.34/22.68 [2019-03-28 12:39:03,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 32.34/22.68 [2019-03-28 12:39:03,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.34/22.68 [2019-03-28 12:39:03,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.34/22.68 [2019-03-28 12:39:03,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,715 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 32.34/22.68 [2019-03-28 12:39:03,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:03,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.34/22.68 [2019-03-28 12:39:04,063 INFO L300 LassoAnalysis]: Preprocessing complete. 32.34/22.68 [2019-03-28 12:39:04,068 INFO L497 LassoAnalysis]: Using template 'affine'. 32.34/22.68 [2019-03-28 12:39:04,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.34/22.68 [2019-03-28 12:39:04,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.34/22.68 [2019-03-28 12:39:04,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.34/22.68 [2019-03-28 12:39:04,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.34/22.68 [2019-03-28 12:39:04,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.34/22.68 [2019-03-28 12:39:04,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.34/22.68 [2019-03-28 12:39:04,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.34/22.68 Termination analysis: LINEAR_WITH_GUESSES 32.34/22.68 Number of strict supporting invariants: 0 32.34/22.68 Number of non-strict supporting invariants: 1 32.34/22.68 Consider only non-deceasing supporting invariants: true 32.34/22.68 Simplify termination arguments: true 32.34/22.68 Simplify supporting invariants: trueOverapproximate stem: false 32.34/22.68 [2019-03-28 12:39:04,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.34/22.68 [2019-03-28 12:39:04,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.34/22.68 [2019-03-28 12:39:04,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.34/22.68 [2019-03-28 12:39:04,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.34/22.68 [2019-03-28 12:39:04,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.34/22.68 [2019-03-28 12:39:04,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.34/22.68 [2019-03-28 12:39:04,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.34/22.68 [2019-03-28 12:39:04,177 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 32.34/22.68 [2019-03-28 12:39:04,177 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 32.34/22.68 [2019-03-28 12:39:04,180 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.34/22.68 [2019-03-28 12:39:04,181 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 32.34/22.68 [2019-03-28 12:39:04,182 INFO L518 LassoAnalysis]: Proved termination. 32.34/22.68 [2019-03-28 12:39:04,182 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.34/22.68 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 21 32.34/22.68 Supporting invariants [] 32.34/22.68 [2019-03-28 12:39:04,215 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 32.34/22.68 [2019-03-28 12:39:04,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 32.34/22.68 [2019-03-28 12:39:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.34/22.68 [2019-03-28 12:39:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:04,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 32.34/22.68 [2019-03-28 12:39:04,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.34/22.68 [2019-03-28 12:39:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:04,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 32.34/22.68 [2019-03-28 12:39:04,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.34/22.68 [2019-03-28 12:39:04,381 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 32.34/22.68 [2019-03-28 12:39:04,383 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 32.34/22.68 [2019-03-28 12:39:04,396 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 32.34/22.68 [2019-03-28 12:39:04,398 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 32.34/22.68 [2019-03-28 12:39:04,398 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 32.34/22.68 [2019-03-28 12:39:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.34/22.68 [2019-03-28 12:39:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:04,523 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 32.34/22.68 [2019-03-28 12:39:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:04,533 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 32.34/22.68 [2019-03-28 12:39:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.34/22.68 [2019-03-28 12:39:04,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core 32.34/22.68 [2019-03-28 12:39:04,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.34/22.68 [2019-03-28 12:39:04,596 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 32.34/22.68 [2019-03-28 12:39:04,596 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 65 32.34/22.68 [2019-03-28 12:39:04,606 INFO L427 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 32.34/22.68 [2019-03-28 12:39:04,651 INFO L497 ElimStorePlain]: treesize reduction 18, result has 72.3 percent of original size 32.34/22.68 [2019-03-28 12:39:04,659 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. 32.34/22.68 [2019-03-28 12:39:04,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:52 32.34/22.68 [2019-03-28 12:39:17,209 WARN L188 SmtUtils]: Spent 7.81 s on a formula simplification that was a NOOP. DAG size: 37 32.34/22.68 [2019-03-28 12:39:18,819 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset) 1) (select (select |c_#memory_int| v_prenex_1) v_prenex_2))) (exists ((ULTIMATE.start_main_~c~0.base Int) (ULTIMATE.start_main_~c~0.offset Int)) (not (and (= ULTIMATE.start_main_~c~0.offset c_ULTIMATE.start_main_~i~0.offset) (= c_ULTIMATE.start_main_~i~0.base ULTIMATE.start_main_~c~0.base)))) (exists ((v_arrayElimCell_2 Int)) (and (<= (+ v_arrayElimCell_2 1) (select (select |c_#memory_int| c_ULTIMATE.start_main_~i~0.base) c_ULTIMATE.start_main_~i~0.offset)) (<= 21 (+ (* 2 v_arrayElimCell_2) c_oldRank0))))) is different from true 32.34/22.68 [2019-03-28 12:39:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.34/22.68 [2019-03-28 12:39:18,851 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 32.34/22.68 [2019-03-28 12:39:18,851 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization 32.34/22.68 [2019-03-28 12:39:18,854 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates 32.34/22.68 [2019-03-28 12:39:18,855 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states. Second operand 8 states. 32.34/22.68 [2019-03-28 12:39:19,057 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states.. Second operand 8 states. Result 49 states and 85 transitions. Complement of second has 12 states. 32.34/22.68 [2019-03-28 12:39:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states 32.34/22.68 [2019-03-28 12:39:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 32.34/22.68 [2019-03-28 12:39:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. 32.34/22.68 [2019-03-28 12:39:19,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. 32.34/22.68 [2019-03-28 12:39:19,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.34/22.68 [2019-03-28 12:39:19,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. 32.34/22.68 [2019-03-28 12:39:19,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.34/22.68 [2019-03-28 12:39:19,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. 32.34/22.68 [2019-03-28 12:39:19,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.34/22.68 [2019-03-28 12:39:19,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 85 transitions. 32.34/22.68 [2019-03-28 12:39:19,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 32.34/22.68 [2019-03-28 12:39:19,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 32.34/22.68 [2019-03-28 12:39:19,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 32.34/22.68 [2019-03-28 12:39:19,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 32.34/22.68 [2019-03-28 12:39:19,077 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,077 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,077 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,078 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 32.34/22.68 [2019-03-28 12:39:19,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 32.34/22.68 [2019-03-28 12:39:19,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 32.34/22.68 [2019-03-28 12:39:19,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 32.34/22.68 [2019-03-28 12:39:19,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:19 BasicIcfg 32.34/22.68 [2019-03-28 12:39:19,084 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 32.34/22.68 [2019-03-28 12:39:19,085 INFO L168 Benchmark]: Toolchain (without parser) took 17883.47 ms. Allocated memory was 649.6 MB in the beginning and 746.6 MB in the end (delta: 97.0 MB). Free memory was 558.5 MB in the beginning and 547.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,086 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.83 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 558.5 MB in the beginning and 639.9 MB in the end (delta: -81.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 672.7 MB. Free memory was 639.9 MB in the beginning and 636.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,087 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 672.7 MB. Free memory was 636.8 MB in the beginning and 635.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,088 INFO L168 Benchmark]: RCFGBuilder took 292.17 ms. Allocated memory is still 672.7 MB. Free memory was 635.4 MB in the beginning and 613.2 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,089 INFO L168 Benchmark]: BlockEncodingV2 took 126.86 ms. Allocated memory is still 672.7 MB. Free memory was 613.2 MB in the beginning and 603.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,089 INFO L168 Benchmark]: TraceAbstraction took 976.74 ms. Allocated memory is still 672.7 MB. Free memory was 603.8 MB in the beginning and 515.0 MB in the end (delta: 88.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,090 INFO L168 Benchmark]: BuchiAutomizer took 16110.22 ms. Allocated memory was 672.7 MB in the beginning and 746.6 MB in the end (delta: 73.9 MB). Free memory was 515.0 MB in the beginning and 547.7 MB in the end (delta: -32.7 MB). Peak memory consumption was 41.2 MB. Max. memory is 50.3 GB. 32.34/22.68 [2019-03-28 12:39:19,094 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 32.34/22.68 --- Results --- 32.34/22.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 32.34/22.68 - StatisticsResult: Initial Icfg 32.34/22.68 36 locations, 38 edges 32.34/22.68 - StatisticsResult: Encoded RCFG 32.34/22.68 28 locations, 47 edges 32.34/22.68 * Results from de.uni_freiburg.informatik.ultimate.core: 32.34/22.68 - StatisticsResult: Toolchain Benchmarks 32.34/22.68 Benchmark results are: 32.34/22.68 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 32.34/22.68 * CACSL2BoogieTranslator took 309.83 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 558.5 MB in the beginning and 639.9 MB in the end (delta: -81.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 32.34/22.68 * Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 672.7 MB. Free memory was 639.9 MB in the beginning and 636.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 32.34/22.68 * Boogie Preprocessor took 22.94 ms. Allocated memory is still 672.7 MB. Free memory was 636.8 MB in the beginning and 635.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 32.34/22.68 * RCFGBuilder took 292.17 ms. Allocated memory is still 672.7 MB. Free memory was 635.4 MB in the beginning and 613.2 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 32.34/22.68 * BlockEncodingV2 took 126.86 ms. Allocated memory is still 672.7 MB. Free memory was 613.2 MB in the beginning and 603.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 32.34/22.68 * TraceAbstraction took 976.74 ms. Allocated memory is still 672.7 MB. Free memory was 603.8 MB in the beginning and 515.0 MB in the end (delta: 88.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 50.3 GB. 32.34/22.68 * BuchiAutomizer took 16110.22 ms. Allocated memory was 672.7 MB in the beginning and 746.6 MB in the end (delta: 73.9 MB). Free memory was 515.0 MB in the beginning and 547.7 MB in the end (delta: -32.7 MB). Peak memory consumption was 41.2 MB. Max. memory is 50.3 GB. 32.34/22.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 32.34/22.68 - GenericResult: Unfinished Backtranslation 32.34/22.68 unknown boogie variable #length 32.34/22.68 - GenericResult: Unfinished Backtranslation 32.34/22.68 unknown boogie variable #length 32.34/22.68 - GenericResult: Unfinished Backtranslation 32.34/22.68 unknown boogie variable #length 32.34/22.68 - GenericResult: Unfinished Backtranslation 32.34/22.68 unknown boogie variable #length 32.34/22.68 - GenericResult: Unfinished Backtranslation 32.34/22.68 unknown boogie variable #memory_int 32.34/22.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 32.34/22.68 - PositiveResult [Line: 11]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 10]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 11]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 14]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 8]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 12]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 14]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 10]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 12]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 7]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 8]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 12]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 7]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 11]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 12]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - PositiveResult [Line: 11]: pointer dereference always succeeds 32.34/22.68 For all program executions holds that pointer dereference always succeeds at this location 32.34/22.68 - AllSpecificationsHoldResult: All specifications hold 32.34/22.68 16 specifications checked. All of them hold 32.34/22.68 - InvariantResult [Line: 8]: Loop Invariant 32.34/22.68 [2019-03-28 12:39:19,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:19,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:19,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 [2019-03-28 12:39:19,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 32.34/22.68 Derived loop invariant: ((((4 == unknown-#length-unknown[c] && c == 0) && 4 == unknown-#length-unknown[i]) && 0 == i) && 1 == \valid[c]) && 1 == \valid[i] 32.34/22.68 - StatisticsResult: Ultimate Automizer benchmark data 32.34/22.68 CFG has 1 procedures, 28 locations, 16 error locations. SAFE Result, 0.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 129 SDslu, 4 SDs, 0 SdLazy, 139 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 6 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, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 32.34/22.68 - StatisticsResult: Constructed decomposition of program 32.34/22.68 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 21 and consists of 7 locations. 32.34/22.68 - StatisticsResult: Timing statistics 32.34/22.68 BüchiAutomizer plugin needed 16.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 14.7s. 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: 11 SDtfs, 92 SDslu, 37 SDs, 0 SdLazy, 205 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp94 ukn59 mio100 lsp43 div100 bol100 ite100 ukn100 eq153 hnf91 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 32.34/22.68 - TerminationAnalysisResult: Termination proven 32.34/22.68 Buchi Automizer proved that your program is terminating 32.34/22.68 RESULT: Ultimate proved your program to be correct! 32.34/22.68 !SESSION 2019-03-28 12:38:57.786 ----------------------------------------------- 32.34/22.68 eclipse.buildId=unknown 32.34/22.68 java.version=1.8.0_181 32.34/22.68 java.vendor=Oracle Corporation 32.34/22.68 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 32.34/22.68 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 32.34/22.68 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 32.34/22.68 32.34/22.68 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:39:19.331 32.34/22.68 !MESSAGE The workspace will exit with unsaved changes in this session. 32.34/22.68 Received shutdown request... 32.34/22.68 Ultimate: 32.34/22.68 GTK+ Version Check 32.34/22.68 EOF