78.21/43.36 YES 78.21/43.36 78.21/43.36 Ultimate: Cannot open display: 78.21/43.36 This is Ultimate 0.1.24-8dc7c08-m 78.21/43.36 [2019-03-28 11:58:45,208 INFO L170 SettingsManager]: Resetting all preferences to default values... 78.21/43.36 [2019-03-28 11:58:45,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 78.21/43.36 [2019-03-28 11:58:45,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 78.21/43.36 [2019-03-28 11:58:45,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 78.21/43.36 [2019-03-28 11:58:45,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 78.21/43.36 [2019-03-28 11:58:45,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 78.21/43.36 [2019-03-28 11:58:45,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 78.21/43.36 [2019-03-28 11:58:45,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 78.21/43.36 [2019-03-28 11:58:45,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 78.21/43.36 [2019-03-28 11:58:45,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 78.21/43.36 [2019-03-28 11:58:45,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 78.21/43.36 [2019-03-28 11:58:45,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 78.21/43.36 [2019-03-28 11:58:45,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 78.21/43.36 [2019-03-28 11:58:45,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 78.21/43.36 [2019-03-28 11:58:45,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 78.21/43.36 [2019-03-28 11:58:45,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 78.21/43.36 [2019-03-28 11:58:45,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 78.21/43.36 [2019-03-28 11:58:45,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 78.21/43.36 [2019-03-28 11:58:45,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 78.21/43.36 [2019-03-28 11:58:45,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 78.21/43.36 [2019-03-28 11:58:45,244 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 78.21/43.36 [2019-03-28 11:58:45,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 78.21/43.36 [2019-03-28 11:58:45,245 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 78.21/43.36 [2019-03-28 11:58:45,246 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 78.21/43.36 [2019-03-28 11:58:45,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 78.21/43.36 [2019-03-28 11:58:45,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 78.21/43.36 [2019-03-28 11:58:45,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 78.21/43.36 [2019-03-28 11:58:45,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 78.21/43.36 [2019-03-28 11:58:45,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 78.21/43.36 [2019-03-28 11:58:45,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 78.21/43.36 [2019-03-28 11:58:45,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 78.21/43.36 [2019-03-28 11:58:45,253 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 78.21/43.36 [2019-03-28 11:58:45,268 INFO L110 SettingsManager]: Loading preferences was successful 78.21/43.36 [2019-03-28 11:58:45,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 78.21/43.36 [2019-03-28 11:58:45,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 78.21/43.36 [2019-03-28 11:58:45,270 INFO L133 SettingsManager]: * Rewrite not-equals=true 78.21/43.36 [2019-03-28 11:58:45,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 78.21/43.36 [2019-03-28 11:58:45,270 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 78.21/43.36 [2019-03-28 11:58:45,270 INFO L133 SettingsManager]: * Use SBE=true 78.21/43.36 [2019-03-28 11:58:45,270 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Use old map elimination=false 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 78.21/43.36 [2019-03-28 11:58:45,271 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 78.21/43.36 [2019-03-28 11:58:45,272 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 78.21/43.36 [2019-03-28 11:58:45,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 78.21/43.36 [2019-03-28 11:58:45,272 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 78.21/43.36 [2019-03-28 11:58:45,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE 78.21/43.36 [2019-03-28 11:58:45,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 78.21/43.36 [2019-03-28 11:58:45,272 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 78.21/43.36 [2019-03-28 11:58:45,273 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 78.21/43.36 [2019-03-28 11:58:45,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 78.21/43.36 [2019-03-28 11:58:45,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 78.21/43.36 [2019-03-28 11:58:45,273 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 78.21/43.36 [2019-03-28 11:58:45,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 78.21/43.36 [2019-03-28 11:58:45,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 78.21/43.36 [2019-03-28 11:58:45,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 78.21/43.36 [2019-03-28 11:58:45,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 78.21/43.36 [2019-03-28 11:58:45,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 78.21/43.36 [2019-03-28 11:58:45,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 78.21/43.36 [2019-03-28 11:58:45,314 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 78.21/43.36 [2019-03-28 11:58:45,317 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 78.21/43.36 [2019-03-28 11:58:45,319 INFO L271 PluginConnector]: Initializing CDTParser... 78.21/43.36 [2019-03-28 11:58:45,319 INFO L276 PluginConnector]: CDTParser initialized 78.21/43.36 [2019-03-28 11:58:45,320 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 78.21/43.36 [2019-03-28 11:58:45,390 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/bc946f47ec184dfa9b36a990ecd99b8a/FLAG1ef2a5655 78.21/43.36 [2019-03-28 11:58:45,730 INFO L307 CDTParser]: Found 1 translation units. 78.21/43.36 [2019-03-28 11:58:45,731 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 78.21/43.36 [2019-03-28 11:58:45,731 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 78.21/43.36 [2019-03-28 11:58:45,738 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/bc946f47ec184dfa9b36a990ecd99b8a/FLAG1ef2a5655 78.21/43.36 [2019-03-28 11:58:46,137 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/bc946f47ec184dfa9b36a990ecd99b8a 78.21/43.36 [2019-03-28 11:58:46,149 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 78.21/43.36 [2019-03-28 11:58:46,151 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 78.21/43.36 [2019-03-28 11:58:46,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 78.21/43.36 [2019-03-28 11:58:46,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 78.21/43.36 [2019-03-28 11:58:46,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 78.21/43.36 [2019-03-28 11:58:46,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dbde5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46, skipping insertion in model container 78.21/43.36 [2019-03-28 11:58:46,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 78.21/43.36 [2019-03-28 11:58:46,186 INFO L176 MainTranslator]: Built tables and reachable declarations 78.21/43.36 [2019-03-28 11:58:46,357 INFO L206 PostProcessor]: Analyzing one entry point: main 78.21/43.36 [2019-03-28 11:58:46,369 INFO L191 MainTranslator]: Completed pre-run 78.21/43.36 [2019-03-28 11:58:46,450 INFO L206 PostProcessor]: Analyzing one entry point: main 78.21/43.36 [2019-03-28 11:58:46,467 INFO L195 MainTranslator]: Completed translation 78.21/43.36 [2019-03-28 11:58:46,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46 WrapperNode 78.21/43.36 [2019-03-28 11:58:46,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 78.21/43.36 [2019-03-28 11:58:46,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 78.21/43.36 [2019-03-28 11:58:46,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 78.21/43.36 [2019-03-28 11:58:46,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 78.21/43.36 [2019-03-28 11:58:46,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 78.21/43.36 [2019-03-28 11:58:46,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 78.21/43.36 [2019-03-28 11:58:46,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 78.21/43.36 [2019-03-28 11:58:46,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized 78.21/43.36 [2019-03-28 11:58:46,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 78.21/43.36 [2019-03-28 11:58:46,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 78.21/43.36 [2019-03-28 11:58:46,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... 78.21/43.36 [2019-03-28 11:58:46,544 INFO L276 PluginConnector]: RCFGBuilder initialized 78.21/43.36 [2019-03-28 11:58:46,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (1/1) ... 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 78.21/43.36 [2019-03-28 11:58:46,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 78.21/43.36 [2019-03-28 11:58:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 78.21/43.36 [2019-03-28 11:58:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 78.21/43.36 [2019-03-28 11:58:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 78.21/43.36 [2019-03-28 11:58:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 78.21/43.36 [2019-03-28 11:58:46,927 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 78.21/43.36 [2019-03-28 11:58:46,928 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. 78.21/43.36 [2019-03-28 11:58:46,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:46 BoogieIcfgContainer 78.21/43.36 [2019-03-28 11:58:46,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 78.21/43.36 [2019-03-28 11:58:46,930 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 78.21/43.36 [2019-03-28 11:58:46,930 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 78.21/43.36 [2019-03-28 11:58:46,935 INFO L276 PluginConnector]: BlockEncodingV2 initialized 78.21/43.36 [2019-03-28 11:58:46,936 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:46" (1/1) ... 78.21/43.36 [2019-03-28 11:58:46,954 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 55 edges 78.21/43.36 [2019-03-28 11:58:46,956 INFO L258 BlockEncoder]: Using Remove infeasible edges 78.21/43.36 [2019-03-28 11:58:46,957 INFO L263 BlockEncoder]: Using Maximize final states 78.21/43.36 [2019-03-28 11:58:46,957 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 78.21/43.36 [2019-03-28 11:58:46,958 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 78.21/43.36 [2019-03-28 11:58:46,959 INFO L296 BlockEncoder]: Using Remove sink states 78.21/43.36 [2019-03-28 11:58:46,960 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 78.21/43.36 [2019-03-28 11:58:46,961 INFO L179 BlockEncoder]: Using Rewrite not-equals 78.21/43.36 [2019-03-28 11:58:46,988 INFO L185 BlockEncoder]: Using Use SBE 78.21/43.36 [2019-03-28 11:58:47,022 INFO L200 BlockEncoder]: SBE split 22 edges 78.21/43.36 [2019-03-28 11:58:47,027 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 78.21/43.36 [2019-03-28 11:58:47,029 INFO L71 MaximizeFinalStates]: 0 new accepting states 78.21/43.36 [2019-03-28 11:58:47,070 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 78.21/43.36 [2019-03-28 11:58:47,073 INFO L70 RemoveSinkStates]: Removed 8 edges and 4 locations by removing sink states 78.21/43.36 [2019-03-28 11:58:47,075 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 78.21/43.36 [2019-03-28 11:58:47,075 INFO L71 MaximizeFinalStates]: 0 new accepting states 78.21/43.36 [2019-03-28 11:58:47,075 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 78.21/43.36 [2019-03-28 11:58:47,076 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 78.21/43.36 [2019-03-28 11:58:47,076 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 62 edges 78.21/43.36 [2019-03-28 11:58:47,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:47 BasicIcfg 78.21/43.36 [2019-03-28 11:58:47,077 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 78.21/43.36 [2019-03-28 11:58:47,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 78.21/43.36 [2019-03-28 11:58:47,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... 78.21/43.36 [2019-03-28 11:58:47,082 INFO L276 PluginConnector]: TraceAbstraction initialized 78.21/43.36 [2019-03-28 11:58:47,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:58:46" (1/4) ... 78.21/43.36 [2019-03-28 11:58:47,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:58:47, skipping insertion in model container 78.21/43.36 [2019-03-28 11:58:47,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (2/4) ... 78.21/43.36 [2019-03-28 11:58:47,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:58:47, skipping insertion in model container 78.21/43.36 [2019-03-28 11:58:47,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:46" (3/4) ... 78.21/43.36 [2019-03-28 11:58:47,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe4ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:58:47, skipping insertion in model container 78.21/43.36 [2019-03-28 11:58:47,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:47" (4/4) ... 78.21/43.36 [2019-03-28 11:58:47,086 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 78.21/43.36 [2019-03-28 11:58:47,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 78.21/43.36 [2019-03-28 11:58:47,104 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 78.21/43.36 [2019-03-28 11:58:47,122 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 78.21/43.36 [2019-03-28 11:58:47,152 INFO L133 ementStrategyFactory]: Using default assertion order modulation 78.21/43.36 [2019-03-28 11:58:47,152 INFO L382 AbstractCegarLoop]: Interprodecural is true 78.21/43.36 [2019-03-28 11:58:47,153 INFO L383 AbstractCegarLoop]: Hoare is true 78.21/43.36 [2019-03-28 11:58:47,153 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 78.21/43.36 [2019-03-28 11:58:47,153 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 78.21/43.36 [2019-03-28 11:58:47,153 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 78.21/43.36 [2019-03-28 11:58:47,153 INFO L387 AbstractCegarLoop]: Difference is false 78.21/43.36 [2019-03-28 11:58:47,153 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 78.21/43.36 [2019-03-28 11:58:47,154 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 78.21/43.36 [2019-03-28 11:58:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. 78.21/43.36 [2019-03-28 11:58:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 78.21/43.36 [2019-03-28 11:58:47,175 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:47,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:47,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 7657052, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:47,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:47,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:47,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:47,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:47,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.36 [2019-03-28 11:58:47,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:47,377 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:47,500 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. 78.21/43.36 [2019-03-28 11:58:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:47,515 INFO L225 Difference]: With dead ends: 34 78.21/43.36 [2019-03-28 11:58:47,515 INFO L226 Difference]: Without dead ends: 32 78.21/43.36 [2019-03-28 11:58:47,519 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 78.21/43.36 [2019-03-28 11:58:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 78.21/43.36 [2019-03-28 11:58:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. 78.21/43.36 [2019-03-28 11:58:47,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. 78.21/43.36 [2019-03-28 11:58:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. 78.21/43.36 [2019-03-28 11:58:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 78.21/43.36 [2019-03-28 11:58:47,562 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:47,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:47,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 7657054, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:47,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:47,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:47,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:47,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:47,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:47,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 78.21/43.36 [2019-03-28 11:58:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 78.21/43.36 [2019-03-28 11:58:47,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 78.21/43.36 [2019-03-28 11:58:47,600 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 4 states. 78.21/43.36 [2019-03-28 11:58:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:47,685 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. 78.21/43.36 [2019-03-28 11:58:47,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 78.21/43.36 [2019-03-28 11:58:47,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:47,686 INFO L225 Difference]: With dead ends: 34 78.21/43.36 [2019-03-28 11:58:47,686 INFO L226 Difference]: Without dead ends: 32 78.21/43.36 [2019-03-28 11:58:47,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 78.21/43.36 [2019-03-28 11:58:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 78.21/43.36 [2019-03-28 11:58:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,694 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:47,694 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 78.21/43.36 [2019-03-28 11:58:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 78.21/43.36 [2019-03-28 11:58:47,695 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:47,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:47,695 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash 7657055, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:47,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:47,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.36 [2019-03-28 11:58:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:47,724 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:47,823 INFO L93 Difference]: Finished difference Result 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:47,825 INFO L225 Difference]: With dead ends: 32 78.21/43.36 [2019-03-28 11:58:47,825 INFO L226 Difference]: Without dead ends: 30 78.21/43.36 [2019-03-28 11:58:47,825 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 78.21/43.36 [2019-03-28 11:58:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 78.21/43.36 [2019-03-28 11:58:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 78.21/43.36 [2019-03-28 11:58:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 78.21/43.36 [2019-03-28 11:58:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. 78.21/43.36 [2019-03-28 11:58:47,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 4 78.21/43.36 [2019-03-28 11:58:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:47,831 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. 78.21/43.36 [2019-03-28 11:58:47,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. 78.21/43.36 [2019-03-28 11:58:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 78.21/43.36 [2019-03-28 11:58:47,832 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:47,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:47,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 773565417, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:47,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:47,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:47,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:47,874 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:47,970 INFO L93 Difference]: Finished difference Result 54 states and 101 transitions. 78.21/43.36 [2019-03-28 11:58:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 78.21/43.36 [2019-03-28 11:58:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:47,972 INFO L225 Difference]: With dead ends: 54 78.21/43.36 [2019-03-28 11:58:47,972 INFO L226 Difference]: Without dead ends: 32 78.21/43.36 [2019-03-28 11:58:47,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 78.21/43.36 [2019-03-28 11:58:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 78.21/43.36 [2019-03-28 11:58:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 11 78.21/43.36 [2019-03-28 11:58:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:47,979 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. 78.21/43.36 [2019-03-28 11:58:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 78.21/43.36 [2019-03-28 11:58:47,980 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:47,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:47,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash 773566378, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:47,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:47,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:47,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:48,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:48,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:48,029 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:48,146 INFO L93 Difference]: Finished difference Result 70 states and 122 transitions. 78.21/43.36 [2019-03-28 11:58:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:48,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 78.21/43.36 [2019-03-28 11:58:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:48,148 INFO L225 Difference]: With dead ends: 70 78.21/43.36 [2019-03-28 11:58:48,148 INFO L226 Difference]: Without dead ends: 46 78.21/43.36 [2019-03-28 11:58:48,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 78.21/43.36 [2019-03-28 11:58:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. 78.21/43.36 [2019-03-28 11:58:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 78.21/43.36 [2019-03-28 11:58:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. 78.21/43.36 [2019-03-28 11:58:48,155 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 11 78.21/43.36 [2019-03-28 11:58:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:48,156 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 68 transitions. 78.21/43.36 [2019-03-28 11:58:48,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. 78.21/43.36 [2019-03-28 11:58:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 78.21/43.36 [2019-03-28 11:58:48,156 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:48,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:48,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 773596169, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:48,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:48,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:48,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 78.21/43.36 [2019-03-28 11:58:48,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 78.21/43.36 [2019-03-28 11:58:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 78.21/43.36 [2019-03-28 11:58:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 78.21/43.36 [2019-03-28 11:58:48,249 INFO L87 Difference]: Start difference. First operand 37 states and 68 transitions. Second operand 6 states. 78.21/43.36 [2019-03-28 11:58:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:48,591 INFO L93 Difference]: Finished difference Result 124 states and 247 transitions. 78.21/43.36 [2019-03-28 11:58:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 78.21/43.36 [2019-03-28 11:58:48,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 78.21/43.36 [2019-03-28 11:58:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:48,594 INFO L225 Difference]: With dead ends: 124 78.21/43.36 [2019-03-28 11:58:48,594 INFO L226 Difference]: Without dead ends: 121 78.21/43.36 [2019-03-28 11:58:48,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 78.21/43.36 [2019-03-28 11:58:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. 78.21/43.36 [2019-03-28 11:58:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 34. 78.21/43.36 [2019-03-28 11:58:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 78.21/43.36 [2019-03-28 11:58:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:48,603 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 11 78.21/43.36 [2019-03-28 11:58:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:48,603 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:48,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 78.21/43.36 [2019-03-28 11:58:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 78.21/43.36 [2019-03-28 11:58:48,604 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:48,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:48,604 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:48,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:48,605 INFO L82 PathProgramCache]: Analyzing trace with hash 773596171, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:48,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:48,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 78.21/43.36 [2019-03-28 11:58:48,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 78.21/43.36 [2019-03-28 11:58:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 78.21/43.36 [2019-03-28 11:58:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 78.21/43.36 [2019-03-28 11:58:48,705 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 7 states. 78.21/43.36 [2019-03-28 11:58:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:49,201 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. 78.21/43.36 [2019-03-28 11:58:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 78.21/43.36 [2019-03-28 11:58:49,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 78.21/43.36 [2019-03-28 11:58:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:49,203 INFO L225 Difference]: With dead ends: 170 78.21/43.36 [2019-03-28 11:58:49,203 INFO L226 Difference]: Without dead ends: 167 78.21/43.36 [2019-03-28 11:58:49,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 78.21/43.36 [2019-03-28 11:58:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. 78.21/43.36 [2019-03-28 11:58:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 53. 78.21/43.36 [2019-03-28 11:58:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 78.21/43.36 [2019-03-28 11:58:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 95 transitions. 78.21/43.36 [2019-03-28 11:58:49,216 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 95 transitions. Word has length 11 78.21/43.36 [2019-03-28 11:58:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:49,216 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 95 transitions. 78.21/43.36 [2019-03-28 11:58:49,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 78.21/43.36 [2019-03-28 11:58:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 95 transitions. 78.21/43.36 [2019-03-28 11:58:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 78.21/43.36 [2019-03-28 11:58:49,217 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:49,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:49,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1033858292, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:49,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:49,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:49,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:49,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 78.21/43.36 [2019-03-28 11:58:49,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 78.21/43.36 [2019-03-28 11:58:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 78.21/43.36 [2019-03-28 11:58:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 78.21/43.36 [2019-03-28 11:58:49,304 INFO L87 Difference]: Start difference. First operand 53 states and 95 transitions. Second operand 7 states. 78.21/43.36 [2019-03-28 11:58:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:49,460 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. 78.21/43.36 [2019-03-28 11:58:49,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 78.21/43.36 [2019-03-28 11:58:49,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 78.21/43.36 [2019-03-28 11:58:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:49,462 INFO L225 Difference]: With dead ends: 79 78.21/43.36 [2019-03-28 11:58:49,462 INFO L226 Difference]: Without dead ends: 76 78.21/43.36 [2019-03-28 11:58:49,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 78.21/43.36 [2019-03-28 11:58:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. 78.21/43.36 [2019-03-28 11:58:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. 78.21/43.36 [2019-03-28 11:58:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 78.21/43.36 [2019-03-28 11:58:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. 78.21/43.36 [2019-03-28 11:58:49,470 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 11 78.21/43.36 [2019-03-28 11:58:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:49,470 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. 78.21/43.36 [2019-03-28 11:58:49,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 78.21/43.36 [2019-03-28 11:58:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. 78.21/43.36 [2019-03-28 11:58:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 78.21/43.36 [2019-03-28 11:58:49,471 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:49,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:49,471 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325119, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:49,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:49,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:49,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 78.21/43.36 [2019-03-28 11:58:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 78.21/43.36 [2019-03-28 11:58:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 78.21/43.36 [2019-03-28 11:58:49,518 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand 4 states. 78.21/43.36 [2019-03-28 11:58:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:49,611 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. 78.21/43.36 [2019-03-28 11:58:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 78.21/43.36 [2019-03-28 11:58:49,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:49,612 INFO L225 Difference]: With dead ends: 59 78.21/43.36 [2019-03-28 11:58:49,612 INFO L226 Difference]: Without dead ends: 57 78.21/43.36 [2019-03-28 11:58:49,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 78.21/43.36 [2019-03-28 11:58:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. 78.21/43.36 [2019-03-28 11:58:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. 78.21/43.36 [2019-03-28 11:58:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 78.21/43.36 [2019-03-28 11:58:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. 78.21/43.36 [2019-03-28 11:58:49,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:49,621 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 89 transitions. 78.21/43.36 [2019-03-28 11:58:49,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 78.21/43.36 [2019-03-28 11:58:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 89 transitions. 78.21/43.36 [2019-03-28 11:58:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 78.21/43.36 [2019-03-28 11:58:49,622 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:49,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:49,622 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325122, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:49,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:49,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.36 [2019-03-28 11:58:49,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:49,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:49,657 INFO L87 Difference]: Start difference. First operand 49 states and 89 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:49,715 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. 78.21/43.36 [2019-03-28 11:58:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:49,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:49,716 INFO L225 Difference]: With dead ends: 49 78.21/43.36 [2019-03-28 11:58:49,717 INFO L226 Difference]: Without dead ends: 47 78.21/43.36 [2019-03-28 11:58:49,717 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 78.21/43.36 [2019-03-28 11:58:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 78.21/43.36 [2019-03-28 11:58:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 78.21/43.36 [2019-03-28 11:58:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 78.21/43.36 [2019-03-28 11:58:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 81 transitions. 78.21/43.36 [2019-03-28 11:58:49,723 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 81 transitions. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:49,723 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 81 transitions. 78.21/43.36 [2019-03-28 11:58:49,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. 78.21/43.36 [2019-03-28 11:58:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 78.21/43.36 [2019-03-28 11:58:49,724 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:49,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:49,724 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325120, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:49,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:49,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:49,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:49,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 78.21/43.36 [2019-03-28 11:58:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 78.21/43.36 [2019-03-28 11:58:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 78.21/43.36 [2019-03-28 11:58:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 78.21/43.36 [2019-03-28 11:58:49,777 INFO L87 Difference]: Start difference. First operand 47 states and 81 transitions. Second operand 5 states. 78.21/43.36 [2019-03-28 11:58:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:49,945 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. 78.21/43.36 [2019-03-28 11:58:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 78.21/43.36 [2019-03-28 11:58:49,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:49,947 INFO L225 Difference]: With dead ends: 97 78.21/43.36 [2019-03-28 11:58:49,947 INFO L226 Difference]: Without dead ends: 90 78.21/43.36 [2019-03-28 11:58:49,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 78.21/43.36 [2019-03-28 11:58:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. 78.21/43.36 [2019-03-28 11:58:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. 78.21/43.36 [2019-03-28 11:58:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 78.21/43.36 [2019-03-28 11:58:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 93 transitions. 78.21/43.36 [2019-03-28 11:58:49,954 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 93 transitions. Word has length 12 78.21/43.36 [2019-03-28 11:58:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:49,955 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 93 transitions. 78.21/43.36 [2019-03-28 11:58:49,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 78.21/43.36 [2019-03-28 11:58:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 93 transitions. 78.21/43.36 [2019-03-28 11:58:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 78.21/43.36 [2019-03-28 11:58:49,956 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:49,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:49,956 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1012066007, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:49,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:50,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:50,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 78.21/43.36 [2019-03-28 11:58:50,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 78.21/43.36 [2019-03-28 11:58:50,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 78.21/43.36 [2019-03-28 11:58:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 78.21/43.36 [2019-03-28 11:58:50,011 INFO L87 Difference]: Start difference. First operand 56 states and 93 transitions. Second operand 5 states. 78.21/43.36 [2019-03-28 11:58:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:50,117 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. 78.21/43.36 [2019-03-28 11:58:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 78.21/43.36 [2019-03-28 11:58:50,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 78.21/43.36 [2019-03-28 11:58:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:50,119 INFO L225 Difference]: With dead ends: 62 78.21/43.36 [2019-03-28 11:58:50,119 INFO L226 Difference]: Without dead ends: 55 78.21/43.36 [2019-03-28 11:58:50,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 78.21/43.36 [2019-03-28 11:58:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. 78.21/43.36 [2019-03-28 11:58:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. 78.21/43.36 [2019-03-28 11:58:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 78.21/43.36 [2019-03-28 11:58:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,124 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 12 78.21/43.36 [2019-03-28 11:58:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:50,125 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 78.21/43.36 [2019-03-28 11:58:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 78.21/43.36 [2019-03-28 11:58:50,125 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:50,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:50,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1508406551, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:50,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:50,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:50,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:50,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:50,156 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:50,208 INFO L93 Difference]: Finished difference Result 70 states and 118 transitions. 78.21/43.36 [2019-03-28 11:58:50,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:50,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 78.21/43.36 [2019-03-28 11:58:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:50,209 INFO L225 Difference]: With dead ends: 70 78.21/43.36 [2019-03-28 11:58:50,209 INFO L226 Difference]: Without dead ends: 46 78.21/43.36 [2019-03-28 11:58:50,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 78.21/43.36 [2019-03-28 11:58:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. 78.21/43.36 [2019-03-28 11:58:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 78.21/43.36 [2019-03-28 11:58:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,215 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 19 78.21/43.36 [2019-03-28 11:58:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 78.21/43.36 [2019-03-28 11:58:50,216 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:50,217 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:50,217 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1537035702, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:50,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:50,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:50,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:50,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.36 [2019-03-28 11:58:50,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 78.21/43.36 [2019-03-28 11:58:50,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.36 [2019-03-28 11:58:50,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:50,247 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand 3 states. 78.21/43.36 [2019-03-28 11:58:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:50,300 INFO L93 Difference]: Finished difference Result 72 states and 115 transitions. 78.21/43.36 [2019-03-28 11:58:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:50,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 78.21/43.36 [2019-03-28 11:58:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:50,301 INFO L225 Difference]: With dead ends: 72 78.21/43.36 [2019-03-28 11:58:50,301 INFO L226 Difference]: Without dead ends: 42 78.21/43.36 [2019-03-28 11:58:50,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.36 [2019-03-28 11:58:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 78.21/43.36 [2019-03-28 11:58:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 78.21/43.36 [2019-03-28 11:58:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 78.21/43.36 [2019-03-28 11:58:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. 78.21/43.36 [2019-03-28 11:58:50,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 19 78.21/43.36 [2019-03-28 11:58:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:50,306 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. 78.21/43.36 [2019-03-28 11:58:50,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 78.21/43.36 [2019-03-28 11:58:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. 78.21/43.36 [2019-03-28 11:58:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 78.21/43.36 [2019-03-28 11:58:50,307 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:50,307 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:50,308 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2035200353, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:50,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:50,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 78.21/43.36 [2019-03-28 11:58:50,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 78.21/43.36 [2019-03-28 11:58:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 78.21/43.36 [2019-03-28 11:58:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 78.21/43.36 [2019-03-28 11:58:50,425 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 9 states. 78.21/43.36 [2019-03-28 11:58:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:50,668 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. 78.21/43.36 [2019-03-28 11:58:50,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 78.21/43.36 [2019-03-28 11:58:50,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 78.21/43.36 [2019-03-28 11:58:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:50,669 INFO L225 Difference]: With dead ends: 83 78.21/43.36 [2019-03-28 11:58:50,669 INFO L226 Difference]: Without dead ends: 44 78.21/43.36 [2019-03-28 11:58:50,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 78.21/43.36 [2019-03-28 11:58:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 78.21/43.36 [2019-03-28 11:58:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. 78.21/43.36 [2019-03-28 11:58:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 78.21/43.36 [2019-03-28 11:58:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:50,674 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 21 78.21/43.36 [2019-03-28 11:58:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:50,674 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 78.21/43.36 [2019-03-28 11:58:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. 78.21/43.36 [2019-03-28 11:58:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 78.21/43.36 [2019-03-28 11:58:50,675 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:50,676 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:50,676 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1554652328, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:50,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:50,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:50,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:58:50,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:58:50,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:50,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 25 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:58:50,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:58:51,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 78.21/43.36 [2019-03-28 11:58:51,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:51,081 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,082 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 78.21/43.36 [2019-03-28 11:58:51,132 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:58:51,135 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 78.21/43.36 [2019-03-28 11:58:51,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:51,157 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:38 78.21/43.36 [2019-03-28 11:58:51,209 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:58:51,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 78.21/43.36 [2019-03-28 11:58:51,212 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,232 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:51,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,234 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 78.21/43.36 [2019-03-28 11:58:51,314 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:58:51,321 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:51,321 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 78.21/43.36 [2019-03-28 11:58:51,325 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,344 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:51,350 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:51,350 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:31 78.21/43.36 [2019-03-28 11:58:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 78.21/43.36 [2019-03-28 11:58:51,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 78.21/43.36 [2019-03-28 11:58:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 78.21/43.36 [2019-03-28 11:58:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 78.21/43.36 [2019-03-28 11:58:51,475 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 17 states. 78.21/43.36 [2019-03-28 11:58:52,394 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 78.21/43.36 [2019-03-28 11:58:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:53,420 INFO L93 Difference]: Finished difference Result 208 states and 294 transitions. 78.21/43.36 [2019-03-28 11:58:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 78.21/43.36 [2019-03-28 11:58:53,421 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 78.21/43.36 [2019-03-28 11:58:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:53,422 INFO L225 Difference]: With dead ends: 208 78.21/43.36 [2019-03-28 11:58:53,422 INFO L226 Difference]: Without dead ends: 205 78.21/43.36 [2019-03-28 11:58:53,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 78.21/43.36 [2019-03-28 11:58:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. 78.21/43.36 [2019-03-28 11:58:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 68. 78.21/43.36 [2019-03-28 11:58:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 78.21/43.36 [2019-03-28 11:58:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. 78.21/43.36 [2019-03-28 11:58:53,433 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 21 78.21/43.36 [2019-03-28 11:58:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:53,434 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. 78.21/43.36 [2019-03-28 11:58:53,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 78.21/43.36 [2019-03-28 11:58:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. 78.21/43.36 [2019-03-28 11:58:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 78.21/43.36 [2019-03-28 11:58:53,435 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:53,435 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:53,435 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1554652329, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:53,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:53,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:58:53,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:58:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:53,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:58:53,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:58:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:53,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 78.21/43.36 [2019-03-28 11:58:53,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 78.21/43.36 [2019-03-28 11:58:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 78.21/43.36 [2019-03-28 11:58:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 78.21/43.36 [2019-03-28 11:58:53,586 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 7 states. 78.21/43.36 [2019-03-28 11:58:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:53,700 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. 78.21/43.36 [2019-03-28 11:58:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 78.21/43.36 [2019-03-28 11:58:53,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 78.21/43.36 [2019-03-28 11:58:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:53,701 INFO L225 Difference]: With dead ends: 74 78.21/43.36 [2019-03-28 11:58:53,701 INFO L226 Difference]: Without dead ends: 71 78.21/43.36 [2019-03-28 11:58:53,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 78.21/43.36 [2019-03-28 11:58:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. 78.21/43.36 [2019-03-28 11:58:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. 78.21/43.36 [2019-03-28 11:58:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. 78.21/43.36 [2019-03-28 11:58:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. 78.21/43.36 [2019-03-28 11:58:53,709 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 21 78.21/43.36 [2019-03-28 11:58:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:53,709 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. 78.21/43.36 [2019-03-28 11:58:53,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 78.21/43.36 [2019-03-28 11:58:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. 78.21/43.36 [2019-03-28 11:58:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 78.21/43.36 [2019-03-28 11:58:53,710 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:53,710 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:53,710 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 710180457, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:53,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:53,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:53,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:58:53,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:58:53,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:53,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:58:53,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:58:53,903 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 78.21/43.36 [2019-03-28 11:58:53,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:53,913 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:53,914 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:53,915 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 78.21/43.36 [2019-03-28 11:58:53,953 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:53,954 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 78.21/43.36 [2019-03-28 11:58:53,954 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:53,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:53,973 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 78.21/43.36 [2019-03-28 11:58:53,974 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:53,988 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:53,989 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:53,989 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 78.21/43.36 [2019-03-28 11:58:54,039 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 78.21/43.36 [2019-03-28 11:58:54,040 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:54,062 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:54,063 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:58:54,063 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 78.21/43.36 [2019-03-28 11:58:54,133 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:54,133 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 78.21/43.36 [2019-03-28 11:58:54,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:58:54,147 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:58:54,149 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:58:54,150 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:27 78.21/43.36 [2019-03-28 11:58:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:58:54,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 78.21/43.36 [2019-03-28 11:58:54,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 78.21/43.36 [2019-03-28 11:58:54,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 78.21/43.36 [2019-03-28 11:58:54,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 78.21/43.36 [2019-03-28 11:58:54,236 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 15 states. 78.21/43.36 [2019-03-28 11:58:54,567 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 78.21/43.36 [2019-03-28 11:58:54,718 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 78.21/43.36 [2019-03-28 11:58:59,637 WARN L188 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 78.21/43.36 [2019-03-28 11:58:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:58:59,924 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. 78.21/43.36 [2019-03-28 11:58:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 78.21/43.36 [2019-03-28 11:58:59,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 78.21/43.36 [2019-03-28 11:58:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:58:59,925 INFO L225 Difference]: With dead ends: 82 78.21/43.36 [2019-03-28 11:58:59,925 INFO L226 Difference]: Without dead ends: 80 78.21/43.36 [2019-03-28 11:58:59,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 78.21/43.36 [2019-03-28 11:58:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. 78.21/43.36 [2019-03-28 11:58:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. 78.21/43.36 [2019-03-28 11:58:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 78.21/43.36 [2019-03-28 11:58:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:59,933 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 21 78.21/43.36 [2019-03-28 11:58:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:58:59,933 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:59,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 78.21/43.36 [2019-03-28 11:58:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. 78.21/43.36 [2019-03-28 11:58:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 78.21/43.36 [2019-03-28 11:58:59,934 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:58:59,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:58:59,934 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:58:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:58:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash 949579268, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:58:59,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:58:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:58:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:58:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:58:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:58:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:58:59,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:58:59,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:00,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:00,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 78.21/43.36 [2019-03-28 11:59:00,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 78.21/43.36 [2019-03-28 11:59:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 78.21/43.36 [2019-03-28 11:59:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 78.21/43.36 [2019-03-28 11:59:00,060 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 6 states. 78.21/43.36 [2019-03-28 11:59:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:00,161 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. 78.21/43.36 [2019-03-28 11:59:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 78.21/43.36 [2019-03-28 11:59:00,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 78.21/43.36 [2019-03-28 11:59:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:00,162 INFO L225 Difference]: With dead ends: 54 78.21/43.36 [2019-03-28 11:59:00,162 INFO L226 Difference]: Without dead ends: 52 78.21/43.36 [2019-03-28 11:59:00,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 78.21/43.36 [2019-03-28 11:59:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. 78.21/43.36 [2019-03-28 11:59:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. 78.21/43.36 [2019-03-28 11:59:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 78.21/43.36 [2019-03-28 11:59:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. 78.21/43.36 [2019-03-28 11:59:00,169 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 22 78.21/43.36 [2019-03-28 11:59:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:00,169 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. 78.21/43.36 [2019-03-28 11:59:00,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 78.21/43.36 [2019-03-28 11:59:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. 78.21/43.36 [2019-03-28 11:59:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 78.21/43.36 [2019-03-28 11:59:00,170 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:00,170 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:00,170 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash 949579267, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:59:00,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:00,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:00,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:00,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:00,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:00,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 78.21/43.36 [2019-03-28 11:59:00,419 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:00,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:00,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:00,430 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 78.21/43.36 [2019-03-28 11:59:00,578 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:00,579 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 78.21/43.36 [2019-03-28 11:59:00,587 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 78.21/43.36 [2019-03-28 11:59:00,639 INFO L497 ElimStorePlain]: treesize reduction 40, result has 48.1 percent of original size 78.21/43.36 [2019-03-28 11:59:00,642 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:00,642 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:37 78.21/43.36 [2019-03-28 11:59:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:00,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 78.21/43.36 [2019-03-28 11:59:00,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 78.21/43.36 [2019-03-28 11:59:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 78.21/43.36 [2019-03-28 11:59:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 78.21/43.36 [2019-03-28 11:59:00,796 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand 17 states. 78.21/43.36 [2019-03-28 11:59:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:02,488 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. 78.21/43.36 [2019-03-28 11:59:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 78.21/43.36 [2019-03-28 11:59:02,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 78.21/43.36 [2019-03-28 11:59:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:02,489 INFO L225 Difference]: With dead ends: 58 78.21/43.36 [2019-03-28 11:59:02,489 INFO L226 Difference]: Without dead ends: 47 78.21/43.36 [2019-03-28 11:59:02,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 78.21/43.36 [2019-03-28 11:59:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 78.21/43.36 [2019-03-28 11:59:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. 78.21/43.36 [2019-03-28 11:59:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 78.21/43.36 [2019-03-28 11:59:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. 78.21/43.36 [2019-03-28 11:59:02,495 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 22 78.21/43.36 [2019-03-28 11:59:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:02,495 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. 78.21/43.36 [2019-03-28 11:59:02,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 78.21/43.36 [2019-03-28 11:59:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. 78.21/43.36 [2019-03-28 11:59:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 78.21/43.36 [2019-03-28 11:59:02,496 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:02,496 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:02,496 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2039814404, now seen corresponding path program 2 times 78.21/43.36 [2019-03-28 11:59:02,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:02,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:02,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:02,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:02,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:02,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:02,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:02,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 78.21/43.36 [2019-03-28 11:59:02,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 78.21/43.36 [2019-03-28 11:59:02,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:02,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:02,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:02,849 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:02,849 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,855 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:02,855 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,855 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 78.21/43.36 [2019-03-28 11:59:02,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 78.21/43.36 [2019-03-28 11:59:02,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,884 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:02,885 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. 78.21/43.36 [2019-03-28 11:59:02,885 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 78.21/43.36 [2019-03-28 11:59:02,912 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:02,913 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 78.21/43.36 [2019-03-28 11:59:02,914 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,924 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:02,924 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 78.21/43.36 [2019-03-28 11:59:02,957 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:02,958 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 78.21/43.36 [2019-03-28 11:59:02,958 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:02,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:02,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 78.21/43.36 [2019-03-28 11:59:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:03,084 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:03,085 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 78.21/43.36 [2019-03-28 11:59:03,086 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:59:03,100 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:03,102 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:03,102 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:27 78.21/43.36 [2019-03-28 11:59:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:03,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:03,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 78.21/43.36 [2019-03-28 11:59:03,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 78.21/43.36 [2019-03-28 11:59:03,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 78.21/43.36 [2019-03-28 11:59:03,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 78.21/43.36 [2019-03-28 11:59:03,236 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 19 states. 78.21/43.36 [2019-03-28 11:59:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:05,392 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. 78.21/43.36 [2019-03-28 11:59:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 78.21/43.36 [2019-03-28 11:59:05,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 78.21/43.36 [2019-03-28 11:59:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:05,394 INFO L225 Difference]: With dead ends: 207 78.21/43.36 [2019-03-28 11:59:05,394 INFO L226 Difference]: Without dead ends: 205 78.21/43.36 [2019-03-28 11:59:05,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 78.21/43.36 [2019-03-28 11:59:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. 78.21/43.36 [2019-03-28 11:59:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. 78.21/43.36 [2019-03-28 11:59:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. 78.21/43.36 [2019-03-28 11:59:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. 78.21/43.36 [2019-03-28 11:59:05,407 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 31 78.21/43.36 [2019-03-28 11:59:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:05,408 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. 78.21/43.36 [2019-03-28 11:59:05,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 78.21/43.36 [2019-03-28 11:59:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. 78.21/43.36 [2019-03-28 11:59:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 78.21/43.36 [2019-03-28 11:59:05,408 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:05,409 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:05,409 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1346712707, now seen corresponding path program 2 times 78.21/43.36 [2019-03-28 11:59:05,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:05,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:05,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:05,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:05,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:05,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 78.21/43.36 [2019-03-28 11:59:05,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 78.21/43.36 [2019-03-28 11:59:05,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:05,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:05,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:05,687 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:05,687 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,691 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,691 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 78.21/43.36 [2019-03-28 11:59:05,709 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 78.21/43.36 [2019-03-28 11:59:05,710 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,716 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,717 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. 78.21/43.36 [2019-03-28 11:59:05,717 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 78.21/43.36 [2019-03-28 11:59:05,744 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:05,746 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 78.21/43.36 [2019-03-28 11:59:05,746 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,757 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,763 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,764 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 78.21/43.36 [2019-03-28 11:59:05,764 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,772 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,773 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,773 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 78.21/43.36 [2019-03-28 11:59:05,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 78.21/43.36 [2019-03-28 11:59:05,803 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,812 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,813 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,813 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 78.21/43.36 [2019-03-28 11:59:05,921 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,922 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 78.21/43.36 [2019-03-28 11:59:05,923 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,937 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:05,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:05,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 78.21/43.36 [2019-03-28 11:59:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:06,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:06,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 78.21/43.36 [2019-03-28 11:59:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 78.21/43.36 [2019-03-28 11:59:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 78.21/43.36 [2019-03-28 11:59:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 78.21/43.36 [2019-03-28 11:59:06,046 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 18 states. 78.21/43.36 [2019-03-28 11:59:06,536 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 78.21/43.36 [2019-03-28 11:59:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:07,389 INFO L93 Difference]: Finished difference Result 154 states and 186 transitions. 78.21/43.36 [2019-03-28 11:59:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 78.21/43.36 [2019-03-28 11:59:07,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 78.21/43.36 [2019-03-28 11:59:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:07,390 INFO L225 Difference]: With dead ends: 154 78.21/43.36 [2019-03-28 11:59:07,391 INFO L226 Difference]: Without dead ends: 152 78.21/43.36 [2019-03-28 11:59:07,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 78.21/43.36 [2019-03-28 11:59:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. 78.21/43.36 [2019-03-28 11:59:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. 78.21/43.36 [2019-03-28 11:59:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 78.21/43.36 [2019-03-28 11:59:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. 78.21/43.36 [2019-03-28 11:59:07,399 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 78.21/43.36 [2019-03-28 11:59:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:07,400 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. 78.21/43.36 [2019-03-28 11:59:07,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 78.21/43.36 [2019-03-28 11:59:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. 78.21/43.36 [2019-03-28 11:59:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 78.21/43.36 [2019-03-28 11:59:07,400 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:07,400 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:07,401 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1190260271, now seen corresponding path program 2 times 78.21/43.36 [2019-03-28 11:59:07,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:07,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:07,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:07,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:07,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:07,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 78.21/43.36 [2019-03-28 11:59:07,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 78.21/43.36 [2019-03-28 11:59:07,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:07,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 29 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:07,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:07,751 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:07,752 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:07,756 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:07,756 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:07,756 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 78.21/43.36 [2019-03-28 11:59:07,776 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 78.21/43.36 [2019-03-28 11:59:07,776 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:07,782 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:07,782 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. 78.21/43.36 [2019-03-28 11:59:07,783 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 78.21/43.36 [2019-03-28 11:59:07,942 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:07,943 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 78.21/43.36 [2019-03-28 11:59:07,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 78.21/43.36 [2019-03-28 11:59:08,000 INFO L497 ElimStorePlain]: treesize reduction 61, result has 40.2 percent of original size 78.21/43.36 [2019-03-28 11:59:08,001 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:08,002 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:41 78.21/43.36 [2019-03-28 11:59:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:08,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:08,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 78.21/43.36 [2019-03-28 11:59:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 78.21/43.36 [2019-03-28 11:59:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 78.21/43.36 [2019-03-28 11:59:08,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 78.21/43.36 [2019-03-28 11:59:08,117 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 18 states. 78.21/43.36 [2019-03-28 11:59:09,077 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 78.21/43.36 [2019-03-28 11:59:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:10,092 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. 78.21/43.36 [2019-03-28 11:59:10,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 78.21/43.36 [2019-03-28 11:59:10,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 78.21/43.36 [2019-03-28 11:59:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:10,093 INFO L225 Difference]: With dead ends: 73 78.21/43.36 [2019-03-28 11:59:10,094 INFO L226 Difference]: Without dead ends: 61 78.21/43.36 [2019-03-28 11:59:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 78.21/43.36 [2019-03-28 11:59:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. 78.21/43.36 [2019-03-28 11:59:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. 78.21/43.36 [2019-03-28 11:59:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. 78.21/43.36 [2019-03-28 11:59:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. 78.21/43.36 [2019-03-28 11:59:10,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 32 78.21/43.36 [2019-03-28 11:59:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:10,102 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. 78.21/43.36 [2019-03-28 11:59:10,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 78.21/43.36 [2019-03-28 11:59:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. 78.21/43.36 [2019-03-28 11:59:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 78.21/43.36 [2019-03-28 11:59:10,102 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:10,103 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:10,103 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -800067631, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:59:10,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:10,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:10,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:10,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:10,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:10,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:10,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 30 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:10,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:10,298 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:10,298 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,303 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,303 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,304 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 78.21/43.36 [2019-03-28 11:59:10,310 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 78.21/43.36 [2019-03-28 11:59:10,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,315 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,315 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,315 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 78.21/43.36 [2019-03-28 11:59:10,320 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:10,321 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 78.21/43.36 [2019-03-28 11:59:10,322 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,331 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,332 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 78.21/43.36 [2019-03-28 11:59:10,359 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:10,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 78.21/43.36 [2019-03-28 11:59:10,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,374 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,374 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,375 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 78.21/43.36 [2019-03-28 11:59:10,474 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:10,479 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,480 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 78.21/43.36 [2019-03-28 11:59:10,480 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,500 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:10,500 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:10,500 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 78.21/43.36 [2019-03-28 11:59:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:10,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 78.21/43.36 [2019-03-28 11:59:10,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 78.21/43.36 [2019-03-28 11:59:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 78.21/43.36 [2019-03-28 11:59:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 78.21/43.36 [2019-03-28 11:59:10,613 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 17 states. 78.21/43.36 [2019-03-28 11:59:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:11,364 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. 78.21/43.36 [2019-03-28 11:59:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 78.21/43.36 [2019-03-28 11:59:11,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 78.21/43.36 [2019-03-28 11:59:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:11,366 INFO L225 Difference]: With dead ends: 203 78.21/43.36 [2019-03-28 11:59:11,366 INFO L226 Difference]: Without dead ends: 201 78.21/43.36 [2019-03-28 11:59:11,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 78.21/43.36 [2019-03-28 11:59:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. 78.21/43.36 [2019-03-28 11:59:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 102. 78.21/43.36 [2019-03-28 11:59:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. 78.21/43.36 [2019-03-28 11:59:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. 78.21/43.36 [2019-03-28 11:59:11,379 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 41 78.21/43.36 [2019-03-28 11:59:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:11,380 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. 78.21/43.36 [2019-03-28 11:59:11,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 78.21/43.36 [2019-03-28 11:59:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. 78.21/43.36 [2019-03-28 11:59:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 78.21/43.36 [2019-03-28 11:59:11,381 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:11,381 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:11,381 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1722751214, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:59:11,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:11,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:11,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:11,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:11,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:11,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:11,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:11,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:11,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:11,616 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:11,616 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,620 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,621 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,621 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 78.21/43.36 [2019-03-28 11:59:11,625 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 78.21/43.36 [2019-03-28 11:59:11,625 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,630 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,630 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 78.21/43.36 [2019-03-28 11:59:11,634 INFO L189 IndexEqualityManager]: detected not equals via solver 78.21/43.36 [2019-03-28 11:59:11,635 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 78.21/43.36 [2019-03-28 11:59:11,636 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,651 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,652 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 78.21/43.36 [2019-03-28 11:59:11,652 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,660 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 78.21/43.36 [2019-03-28 11:59:11,684 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 78.21/43.36 [2019-03-28 11:59:11,685 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,692 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,693 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 78.21/43.36 [2019-03-28 11:59:11,776 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,776 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 78.21/43.36 [2019-03-28 11:59:11,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,791 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:11,792 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:11,792 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 78.21/43.36 [2019-03-28 11:59:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:11,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:11,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 78.21/43.36 [2019-03-28 11:59:11,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 78.21/43.36 [2019-03-28 11:59:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 78.21/43.36 [2019-03-28 11:59:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 78.21/43.36 [2019-03-28 11:59:11,864 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 15 states. 78.21/43.36 [2019-03-28 11:59:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:12,201 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. 78.21/43.36 [2019-03-28 11:59:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 78.21/43.36 [2019-03-28 11:59:12,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 78.21/43.36 [2019-03-28 11:59:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:12,202 INFO L225 Difference]: With dead ends: 102 78.21/43.36 [2019-03-28 11:59:12,202 INFO L226 Difference]: Without dead ends: 100 78.21/43.36 [2019-03-28 11:59:12,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 78.21/43.36 [2019-03-28 11:59:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. 78.21/43.36 [2019-03-28 11:59:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 53. 78.21/43.36 [2019-03-28 11:59:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 78.21/43.36 [2019-03-28 11:59:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. 78.21/43.36 [2019-03-28 11:59:12,210 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 41 78.21/43.36 [2019-03-28 11:59:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:12,210 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. 78.21/43.36 [2019-03-28 11:59:12,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 78.21/43.36 [2019-03-28 11:59:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. 78.21/43.36 [2019-03-28 11:59:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 78.21/43.36 [2019-03-28 11:59:12,211 INFO L394 BasicCegarLoop]: Found error trace 78.21/43.36 [2019-03-28 11:59:12,211 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.36 [2019-03-28 11:59:12,211 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== 78.21/43.36 [2019-03-28 11:59:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.36 [2019-03-28 11:59:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 967704570, now seen corresponding path program 1 times 78.21/43.36 [2019-03-28 11:59:12,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.36 [2019-03-28 11:59:12,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.36 [2019-03-28 11:59:12,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:12,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:12,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:12,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 78.21/43.36 [2019-03-28 11:59:12,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 78.21/43.36 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 78.21/43.36 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 78.21/43.36 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 78.21/43.36 [2019-03-28 11:59:12,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.36 [2019-03-28 11:59:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.36 [2019-03-28 11:59:12,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core 78.21/43.36 [2019-03-28 11:59:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.36 [2019-03-28 11:59:12,424 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 78.21/43.36 [2019-03-28 11:59:12,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,428 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:12,428 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,429 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 78.21/43.36 [2019-03-28 11:59:12,431 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 78.21/43.36 [2019-03-28 11:59:12,432 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,433 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:12,433 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 78.21/43.36 [2019-03-28 11:59:12,520 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 78.21/43.36 [2019-03-28 11:59:12,520 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 78.21/43.36 [2019-03-28 11:59:12,526 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,558 INFO L497 ElimStorePlain]: treesize reduction 25, result has 56.9 percent of original size 78.21/43.36 [2019-03-28 11:59:12,559 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 78.21/43.36 [2019-03-28 11:59:12,559 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 78.21/43.36 [2019-03-28 11:59:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. 78.21/43.36 [2019-03-28 11:59:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 78.21/43.36 [2019-03-28 11:59:12,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 78.21/43.36 [2019-03-28 11:59:12,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 78.21/43.36 [2019-03-28 11:59:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 78.21/43.36 [2019-03-28 11:59:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 78.21/43.36 [2019-03-28 11:59:12,644 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 15 states. 78.21/43.36 [2019-03-28 11:59:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.36 [2019-03-28 11:59:13,045 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. 78.21/43.36 [2019-03-28 11:59:13,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 78.21/43.36 [2019-03-28 11:59:13,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 78.21/43.36 [2019-03-28 11:59:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 78.21/43.36 [2019-03-28 11:59:13,046 INFO L225 Difference]: With dead ends: 53 78.21/43.36 [2019-03-28 11:59:13,046 INFO L226 Difference]: Without dead ends: 0 78.21/43.36 [2019-03-28 11:59:13,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 78.21/43.36 [2019-03-28 11:59:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 78.21/43.36 [2019-03-28 11:59:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 78.21/43.36 [2019-03-28 11:59:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 78.21/43.36 [2019-03-28 11:59:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 78.21/43.36 [2019-03-28 11:59:13,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 78.21/43.36 [2019-03-28 11:59:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. 78.21/43.36 [2019-03-28 11:59:13,048 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 78.21/43.36 [2019-03-28 11:59:13,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 78.21/43.36 [2019-03-28 11:59:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 78.21/43.36 [2019-03-28 11:59:13,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 78.21/43.36 [2019-03-28 11:59:13,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 78.21/43.36 [2019-03-28 11:59:13,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 78.21/43.36 [2019-03-28 11:59:13,572 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 328 78.21/43.36 [2019-03-28 11:59:21,500 WARN L188 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 317 DAG size of output: 105 78.21/43.36 [2019-03-28 11:59:21,707 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point L31-2(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,712 INFO L448 ceAbstractionStarter]: For program point L31-3(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,712 INFO L448 ceAbstractionStarter]: For program point L31-4(line 31) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,712 INFO L448 ceAbstractionStarter]: For program point L31-6(lines 31 38) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L444 ceAbstractionStarter]: At program point L31-8(lines 31 38) the Hoare annotation is: (let ((.cse3 (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (.cse28 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base))) (.cse15 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) (.cse27 (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse25 (<= 1 .cse27)) (.cse22 (= 0 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse20 (and .cse9 .cse10 .cse14 .cse15)) (.cse26 (<= 1 .cse28)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse13 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse23 (<= 1 .cse3)) (.cse16 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse17 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse24 (= 0 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse0 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1))))))) (.cse6 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int) (v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 Int)) (and (<= (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 (- 1))) 0) (<= |ULTIMATE.start_main_#t~ret13.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= 1 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25)))) (.cse8 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse19 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse7 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse28)) (.cse1 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|))) (.cse4 (= (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ .cse28 (- 1))) 0)) (.cse18 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse27)) (.cse5 (= 0 (select .cse21 (+ .cse27 (- 1))))) (.cse2 (and .cse25 .cse22 .cse20 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse24)) (.cse11 (<= (+ ULTIMATE.start_cstrncmp_~n 1) 0))) (or (and (and (and .cse0 .cse1 .cse2) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ .cse3 (- 1))) 0) .cse4) .cse5) (and (and .cse6 .cse7 .cse8 .cse1 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) .cse18 .cse19) (and (and (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))))) .cse0 (and (and .cse20 .cse12 .cse13) .cse6 .cse8 .cse19)) .cse7 .cse1 .cse4 .cse17) .cse18 .cse16 .cse5) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse2 (= (select .cse21 ULTIMATE.start_cstrncmp_~s2.offset) 0)) (and .cse22 .cse9 .cse10 .cse11 .cse13 .cse12 .cse23 .cse16 .cse15 .cse24 .cse25 .cse26 .cse14 .cse17))))) 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point L31-9(lines 31 38) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point L34-3(line 34) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point L34-4(lines 34 35) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 29) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,714 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) 78.21/43.37 [2019-03-28 11:59:21,715 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse1 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse2 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse3 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse4 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0 .cse1 (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) .cse2 .cse3 .cse4) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|)) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))))) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int) (v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 Int)) (and (<= (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 (- 1))) 0) (<= |ULTIMATE.start_main_#t~ret13.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= 1 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25))) (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0 .cse1 .cse2 .cse3 .cse4)))))) 78.21/43.37 [2019-03-28 11:59:21,715 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,715 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,715 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,715 INFO L448 ceAbstractionStarter]: For program point L12-5(lines 12 14) no Hoare annotation was computed. 78.21/43.37 [2019-03-28 11:59:21,715 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 78.21/43.37 [2019-03-28 11:59:21,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:21,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:21,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:21,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:59:21 BasicIcfg 78.21/43.37 [2019-03-28 11:59:21,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 78.21/43.37 [2019-03-28 11:59:21,798 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 78.21/43.37 [2019-03-28 11:59:21,798 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 78.21/43.37 [2019-03-28 11:59:21,802 INFO L276 PluginConnector]: BuchiAutomizer initialized 78.21/43.37 [2019-03-28 11:59:21,802 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 78.21/43.37 [2019-03-28 11:59:21,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:58:46" (1/5) ... 78.21/43.37 [2019-03-28 11:59:21,803 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37afb9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:59:21, skipping insertion in model container 78.21/43.37 [2019-03-28 11:59:21,803 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 78.21/43.37 [2019-03-28 11:59:21,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:58:46" (2/5) ... 78.21/43.37 [2019-03-28 11:59:21,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37afb9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:59:21, skipping insertion in model container 78.21/43.37 [2019-03-28 11:59:21,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 78.21/43.37 [2019-03-28 11:59:21,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:58:46" (3/5) ... 78.21/43.37 [2019-03-28 11:59:21,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37afb9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:21, skipping insertion in model container 78.21/43.37 [2019-03-28 11:59:21,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 78.21/43.37 [2019-03-28 11:59:21,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:58:47" (4/5) ... 78.21/43.37 [2019-03-28 11:59:21,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37afb9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:21, skipping insertion in model container 78.21/43.37 [2019-03-28 11:59:21,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 78.21/43.37 [2019-03-28 11:59:21,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:59:21" (5/5) ... 78.21/43.37 [2019-03-28 11:59:21,806 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 78.21/43.37 [2019-03-28 11:59:21,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation 78.21/43.37 [2019-03-28 11:59:21,828 INFO L374 BuchiCegarLoop]: Interprodecural is true 78.21/43.37 [2019-03-28 11:59:21,828 INFO L375 BuchiCegarLoop]: Hoare is true 78.21/43.37 [2019-03-28 11:59:21,828 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 78.21/43.37 [2019-03-28 11:59:21,828 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 78.21/43.37 [2019-03-28 11:59:21,828 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 78.21/43.37 [2019-03-28 11:59:21,828 INFO L379 BuchiCegarLoop]: Difference is false 78.21/43.37 [2019-03-28 11:59:21,828 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 78.21/43.37 [2019-03-28 11:59:21,828 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 78.21/43.37 [2019-03-28 11:59:21,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 78.21/43.37 [2019-03-28 11:59:21,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:21,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:21,837 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:21,841 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,842 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,842 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 78.21/43.37 [2019-03-28 11:59:21,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. 78.21/43.37 [2019-03-28 11:59:21,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:21,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:21,843 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:21,844 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,844 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,849 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 19#L12true [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 14#L12-2true [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 34#L12-3true [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 30#L12-5true [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 24#L16-2true [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 29#L28true [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 20#L31-8true 78.21/43.37 [2019-03-28 11:59:21,850 INFO L796 eck$LassoCheckResult]: Loop: 20#L31-8true [188] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|) (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 11#L31-1true [111] L31-1-->L31-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[] 25#L31-6true [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 22#L34true [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 33#L34-4true [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 20#L31-8true 78.21/43.37 [2019-03-28 11:59:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:21,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:21,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:21,882 INFO L82 PathProgramCache]: Analyzing trace with hash 205752197, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:21,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:21,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.37 [2019-03-28 11:59:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.37 [2019-03-28 11:59:21,891 INFO L811 eck$LassoCheckResult]: loop already infeasible 78.21/43.37 [2019-03-28 11:59:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.37 [2019-03-28 11:59:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.37 [2019-03-28 11:59:21,892 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. 78.21/43.37 [2019-03-28 11:59:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.37 [2019-03-28 11:59:21,979 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. 78.21/43.37 [2019-03-28 11:59:21,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.37 [2019-03-28 11:59:21,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 100 transitions. 78.21/43.37 [2019-03-28 11:59:21,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 78.21/43.37 [2019-03-28 11:59:21,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 78.21/43.37 [2019-03-28 11:59:21,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 78.21/43.37 [2019-03-28 11:59:21,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:21,987 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 78.21/43.37 [2019-03-28 11:59:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 78.21/43.37 [2019-03-28 11:59:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,989 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,989 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,990 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 78.21/43.37 [2019-03-28 11:59:21,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 48 transitions. 78.21/43.37 [2019-03-28 11:59:21,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 78.21/43.37 [2019-03-28 11:59:21,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:21,991 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:21,991 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,991 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:21,992 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 118#L12 [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 115#L12-2 [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 99#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 100#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 107#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 108#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 104#L28 [186] L28-->L31-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 105#L31-8 78.21/43.37 [2019-03-28 11:59:21,992 INFO L796 eck$LassoCheckResult]: Loop: 105#L31-8 [188] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|) (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 112#L31-1 [111] L31-1-->L31-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[] 102#L31-6 [200] L31-6-->L34: Formula: (and (< v_ULTIMATE.start_cstrncmp_~n_7 0) |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 119#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 111#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 105#L31-8 78.21/43.37 [2019-03-28 11:59:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151457, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:21,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash 205754119, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.37 [2019-03-28 11:59:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.37 [2019-03-28 11:59:22,013 INFO L811 eck$LassoCheckResult]: loop already infeasible 78.21/43.37 [2019-03-28 11:59:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.37 [2019-03-28 11:59:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.37 [2019-03-28 11:59:22,014 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. cyclomatic complexity: 22 Second operand 3 states. 78.21/43.37 [2019-03-28 11:59:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.37 [2019-03-28 11:59:22,049 INFO L93 Difference]: Finished difference Result 26 states and 41 transitions. 78.21/43.37 [2019-03-28 11:59:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.37 [2019-03-28 11:59:22,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 41 transitions. 78.21/43.37 [2019-03-28 11:59:22,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:22,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 78.21/43.37 [2019-03-28 11:59:22,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 78.21/43.37 [2019-03-28 11:59:22,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:22,052 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 78.21/43.37 [2019-03-28 11:59:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 78.21/43.37 [2019-03-28 11:59:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,053 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,053 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,053 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 78.21/43.37 [2019-03-28 11:59:22,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:22,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:22,054 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:22,054 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,054 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,055 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 174#L12 [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 172#L12-2 [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 159#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 160#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 166#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 167#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 163#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 164#L31-8 78.21/43.37 [2019-03-28 11:59:22,056 INFO L796 eck$LassoCheckResult]: Loop: 164#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 169#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 168#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 165#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 161#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 162#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 176#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 170#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 164#L31-8 78.21/43.37 [2019-03-28 11:59:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 2 times 78.21/43.37 [2019-03-28 11:59:22,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1211391627, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:22,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.37 [2019-03-28 11:59:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 78.21/43.37 [2019-03-28 11:59:22,079 INFO L811 eck$LassoCheckResult]: loop already infeasible 78.21/43.37 [2019-03-28 11:59:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.37 [2019-03-28 11:59:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.37 [2019-03-28 11:59:22,080 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. 78.21/43.37 [2019-03-28 11:59:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.37 [2019-03-28 11:59:22,113 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.37 [2019-03-28 11:59:22,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 78.21/43.37 [2019-03-28 11:59:22,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 78.21/43.37 [2019-03-28 11:59:22,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 78.21/43.37 [2019-03-28 11:59:22,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:22,115 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. 78.21/43.37 [2019-03-28 11:59:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 78.21/43.37 [2019-03-28 11:59:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 78.21/43.37 [2019-03-28 11:59:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. 78.21/43.37 [2019-03-28 11:59:22,117 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. 78.21/43.37 [2019-03-28 11:59:22,117 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. 78.21/43.37 [2019-03-28 11:59:22,117 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 78.21/43.37 [2019-03-28 11:59:22,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. 78.21/43.37 [2019-03-28 11:59:22,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 78.21/43.37 [2019-03-28 11:59:22,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:22,118 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:22,118 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,118 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,119 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 219#L12 [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 216#L12-2 [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 203#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 204#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 210#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 211#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 208#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 209#L31-8 78.21/43.37 [2019-03-28 11:59:22,119 INFO L796 eck$LassoCheckResult]: Loop: 209#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 213#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 212#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 207#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 205#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 206#L31-6 [199] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| |v_ULTIMATE.start_cstrncmp_#t~short7_2| (= v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 221#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 214#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 209#L31-8 78.21/43.37 [2019-03-28 11:59:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 3 times 78.21/43.37 [2019-03-28 11:59:22,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1211390666, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:22,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.37 [2019-03-28 11:59:22,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 78.21/43.37 [2019-03-28 11:59:22,145 INFO L811 eck$LassoCheckResult]: loop already infeasible 78.21/43.37 [2019-03-28 11:59:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 78.21/43.37 [2019-03-28 11:59:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 78.21/43.37 [2019-03-28 11:59:22,145 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. 78.21/43.37 [2019-03-28 11:59:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.37 [2019-03-28 11:59:22,178 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 78.21/43.37 [2019-03-28 11:59:22,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. 78.21/43.37 [2019-03-28 11:59:22,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:22,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 78.21/43.37 [2019-03-28 11:59:22,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 78.21/43.37 [2019-03-28 11:59:22,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:22,180 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 78.21/43.37 [2019-03-28 11:59:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 78.21/43.37 [2019-03-28 11:59:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,181 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,182 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,182 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 78.21/43.37 [2019-03-28 11:59:22,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. 78.21/43.37 [2019-03-28 11:59:22,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:22,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:22,182 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:22,183 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,183 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,184 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 263#L12 [121] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 261#L12-2 [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 248#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 249#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 255#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 256#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 252#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 253#L31-8 78.21/43.37 [2019-03-28 11:59:22,184 INFO L796 eck$LassoCheckResult]: Loop: 253#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 258#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 257#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 254#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 250#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 251#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 265#L34 [126] L34-->L34-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short7_4|) InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} AuxVars[] AssignedVars[] 264#L34-2 [115] L34-2-->L34-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6] 260#L34-3 [218] L34-3-->L34-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short7_5|) (> |v_ULTIMATE.start_cstrncmp_#t~mem6_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short7] 259#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 253#L31-8 78.21/43.37 [2019-03-28 11:59:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 4 times 78.21/43.37 [2019-03-28 11:59:22,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -211207507, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2139166030, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:22,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 78.21/43.37 [2019-03-28 11:59:22,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 78.21/43.37 [2019-03-28 11:59:22,421 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 78.21/43.37 [2019-03-28 11:59:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 78.21/43.37 [2019-03-28 11:59:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 78.21/43.37 [2019-03-28 11:59:22,457 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 6 Second operand 8 states. 78.21/43.37 [2019-03-28 11:59:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 78.21/43.37 [2019-03-28 11:59:22,722 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. 78.21/43.37 [2019-03-28 11:59:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 78.21/43.37 [2019-03-28 11:59:22,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 95 transitions. 78.21/43.37 [2019-03-28 11:59:22,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 78.21/43.37 [2019-03-28 11:59:22,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 47 states and 57 transitions. 78.21/43.37 [2019-03-28 11:59:22,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 78.21/43.37 [2019-03-28 11:59:22,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 78.21/43.37 [2019-03-28 11:59:22,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. 78.21/43.37 [2019-03-28 11:59:22,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:22,726 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. 78.21/43.37 [2019-03-28 11:59:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. 78.21/43.37 [2019-03-28 11:59:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 19. 78.21/43.37 [2019-03-28 11:59:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 78.21/43.37 [2019-03-28 11:59:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. 78.21/43.37 [2019-03-28 11:59:22,728 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. 78.21/43.37 [2019-03-28 11:59:22,728 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. 78.21/43.37 [2019-03-28 11:59:22,728 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 78.21/43.37 [2019-03-28 11:59:22,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. 78.21/43.37 [2019-03-28 11:59:22,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 78.21/43.37 [2019-03-28 11:59:22,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 78.21/43.37 [2019-03-28 11:59:22,729 INFO L119 BuchiIsEmpty]: Starting construction of run 78.21/43.37 [2019-03-28 11:59:22,729 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,729 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 78.21/43.37 [2019-03-28 11:59:22,730 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 394#L12 [150] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 396#L12-2 [175] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 379#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 380#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 386#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 387#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 384#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 385#L31-8 78.21/43.37 [2019-03-28 11:59:22,731 INFO L796 eck$LassoCheckResult]: Loop: 385#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 389#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 388#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 383#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 381#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 382#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 397#L34 [126] L34-->L34-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short7_4|) InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} AuxVars[] AssignedVars[] 395#L34-2 [115] L34-2-->L34-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6] 391#L34-3 [218] L34-3-->L34-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short7_5|) (> |v_ULTIMATE.start_cstrncmp_#t~mem6_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short7] 390#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 385#L31-8 78.21/43.37 [2019-03-28 11:59:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2008954431, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -211207507, now seen corresponding path program 2 times 78.21/43.37 [2019-03-28 11:59:22,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1564525717, now seen corresponding path program 1 times 78.21/43.37 [2019-03-28 11:59:22,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 78.21/43.37 [2019-03-28 11:59:22,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 78.21/43.37 [2019-03-28 11:59:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 78.21/43.37 [2019-03-28 11:59:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 78.21/43.37 [2019-03-28 11:59:22,911 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 78.21/43.37 [2019-03-28 11:59:23,266 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 78.21/43.37 [2019-03-28 11:59:23,379 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 78.21/43.37 [2019-03-28 11:59:23,392 INFO L216 LassoAnalysis]: Preferences: 78.21/43.37 [2019-03-28 11:59:23,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 78.21/43.37 [2019-03-28 11:59:23,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 78.21/43.37 [2019-03-28 11:59:23,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 78.21/43.37 [2019-03-28 11:59:23,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false 78.21/43.37 [2019-03-28 11:59:23,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 78.21/43.37 [2019-03-28 11:59:23,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 78.21/43.37 [2019-03-28 11:59:23,394 INFO L130 ssoRankerPreferences]: Path of dumped script: 78.21/43.37 [2019-03-28 11:59:23,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 78.21/43.37 [2019-03-28 11:59:23,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 78.21/43.37 [2019-03-28 11:59:23,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 78.21/43.37 [2019-03-28 11:59:23,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,691 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 78.21/43.37 [2019-03-28 11:59:23,815 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 78.21/43.37 [2019-03-28 11:59:23,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:23,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 78.21/43.37 [2019-03-28 11:59:24,244 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 78.21/43.37 [2019-03-28 11:59:24,317 INFO L300 LassoAnalysis]: Preprocessing complete. 78.21/43.37 [2019-03-28 11:59:24,323 INFO L497 LassoAnalysis]: Using template 'affine'. 78.21/43.37 [2019-03-28 11:59:24,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 78.21/43.37 [2019-03-28 11:59:24,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 78.21/43.37 [2019-03-28 11:59:24,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 78.21/43.37 Termination analysis: LINEAR_WITH_GUESSES 78.21/43.37 Number of strict supporting invariants: 0 78.21/43.37 Number of non-strict supporting invariants: 1 78.21/43.37 Consider only non-deceasing supporting invariants: true 78.21/43.37 Simplify termination arguments: true 78.21/43.37 Simplify supporting invariants: trueOverapproximate stem: false 78.21/43.37 [2019-03-28 11:59:24,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. 78.21/43.37 [2019-03-28 11:59:24,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 78.21/43.37 [2019-03-28 11:59:24,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 78.21/43.37 [2019-03-28 11:59:24,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 78.21/43.37 [2019-03-28 11:59:24,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 78.21/43.37 [2019-03-28 11:59:24,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 78.21/43.37 [2019-03-28 11:59:24,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 78.21/43.37 [2019-03-28 11:59:24,477 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 78.21/43.37 [2019-03-28 11:59:24,477 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. 78.21/43.37 [2019-03-28 11:59:24,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 78.21/43.37 [2019-03-28 11:59:24,481 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 78.21/43.37 [2019-03-28 11:59:24,481 INFO L518 LassoAnalysis]: Proved termination. 78.21/43.37 [2019-03-28 11:59:24,482 INFO L520 LassoAnalysis]: Termination argument consisting of: 78.21/43.37 Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~ret13.base)_1) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret13.base)_1 78.21/43.37 Supporting invariants [] 78.21/43.37 [2019-03-28 11:59:24,526 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed 78.21/43.37 [2019-03-28 11:59:24,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 78.21/43.37 [2019-03-28 11:59:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:24,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core 78.21/43.37 [2019-03-28 11:59:24,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.37 [2019-03-28 11:59:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:24,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core 78.21/43.37 [2019-03-28 11:59:24,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.37 [2019-03-28 11:59:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 78.21/43.37 [2019-03-28 11:59:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:24,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core 78.21/43.37 [2019-03-28 11:59:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.37 [2019-03-28 11:59:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:24,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core 78.21/43.37 [2019-03-28 11:59:24,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.37 [2019-03-28 11:59:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 78.21/43.37 [2019-03-28 11:59:24,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core 78.21/43.37 [2019-03-28 11:59:24,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... 78.21/43.37 [2019-03-28 11:59:24,939 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 78.21/43.37 [2019-03-28 11:59:24,943 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates 78.21/43.37 [2019-03-28 11:59:24,944 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 24 transitions. cyclomatic complexity: 6 Second operand 8 states. 78.21/43.37 [2019-03-28 11:59:25,131 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 24 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 47 states and 55 transitions. Complement of second has 15 states. 78.21/43.37 [2019-03-28 11:59:25,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 2 non-accepting loop states 1 accepting loop states 78.21/43.37 [2019-03-28 11:59:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 78.21/43.37 [2019-03-28 11:59:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. 78.21/43.37 [2019-03-28 11:59:25,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 8 letters. Loop has 10 letters. 78.21/43.37 [2019-03-28 11:59:25,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. 78.21/43.37 [2019-03-28 11:59:25,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 18 letters. Loop has 10 letters. 78.21/43.37 [2019-03-28 11:59:25,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. 78.21/43.37 [2019-03-28 11:59:25,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 8 letters. Loop has 20 letters. 78.21/43.37 [2019-03-28 11:59:25,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. 78.21/43.37 [2019-03-28 11:59:25,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. 78.21/43.37 [2019-03-28 11:59:25,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 78.21/43.37 [2019-03-28 11:59:25,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 78.21/43.37 [2019-03-28 11:59:25,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 78.21/43.37 [2019-03-28 11:59:25,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 78.21/43.37 [2019-03-28 11:59:25,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 78.21/43.37 [2019-03-28 11:59:25,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 78.21/43.37 [2019-03-28 11:59:25,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 78.21/43.37 [2019-03-28 11:59:25,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:59:25 BasicIcfg 78.21/43.37 [2019-03-28 11:59:25,152 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 78.21/43.37 [2019-03-28 11:59:25,152 INFO L168 Benchmark]: Toolchain (without parser) took 39002.90 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 351.3 MB). Free memory was 563.9 MB in the beginning and 781.4 MB in the end (delta: -217.5 MB). Peak memory consumption was 133.8 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,153 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 563.9 MB in the beginning and 640.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 675.3 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,154 INFO L168 Benchmark]: Boogie Preprocessor took 27.83 ms. Allocated memory is still 675.3 MB. Free memory was 637.3 MB in the beginning and 634.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,154 INFO L168 Benchmark]: RCFGBuilder took 386.17 ms. Allocated memory is still 675.3 MB. Free memory was 634.6 MB in the beginning and 609.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,155 INFO L168 Benchmark]: BlockEncodingV2 took 147.08 ms. Allocated memory is still 675.3 MB. Free memory was 609.2 MB in the beginning and 598.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,155 INFO L168 Benchmark]: TraceAbstraction took 34719.28 ms. Allocated memory was 675.3 MB in the beginning and 996.7 MB in the end (delta: 321.4 MB). Free memory was 597.1 MB in the beginning and 861.6 MB in the end (delta: -264.5 MB). Peak memory consumption was 510.4 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,155 INFO L168 Benchmark]: BuchiAutomizer took 3353.65 ms. Allocated memory was 996.7 MB in the beginning and 1.0 GB in the end (delta: 4.2 MB). Free memory was 861.6 MB in the beginning and 781.4 MB in the end (delta: 80.2 MB). Peak memory consumption was 84.4 MB. Max. memory is 50.3 GB. 78.21/43.37 [2019-03-28 11:59:25,159 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 78.21/43.37 --- Results --- 78.21/43.37 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 78.21/43.37 - StatisticsResult: Initial Icfg 78.21/43.37 47 locations, 55 edges 78.21/43.37 - StatisticsResult: Encoded RCFG 78.21/43.37 34 locations, 62 edges 78.21/43.37 * Results from de.uni_freiburg.informatik.ultimate.core: 78.21/43.37 - StatisticsResult: Toolchain Benchmarks 78.21/43.37 Benchmark results are: 78.21/43.37 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 78.21/43.37 * CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 649.6 MB in the beginning and 675.3 MB in the end (delta: 25.7 MB). Free memory was 563.9 MB in the beginning and 640.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 78.21/43.37 * Boogie Procedure Inliner took 46.53 ms. Allocated memory is still 675.3 MB. Free memory was 640.4 MB in the beginning and 637.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 78.21/43.37 * Boogie Preprocessor took 27.83 ms. Allocated memory is still 675.3 MB. Free memory was 637.3 MB in the beginning and 634.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 78.21/43.37 * RCFGBuilder took 386.17 ms. Allocated memory is still 675.3 MB. Free memory was 634.6 MB in the beginning and 609.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. 78.21/43.37 * BlockEncodingV2 took 147.08 ms. Allocated memory is still 675.3 MB. Free memory was 609.2 MB in the beginning and 598.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 78.21/43.37 * TraceAbstraction took 34719.28 ms. Allocated memory was 675.3 MB in the beginning and 996.7 MB in the end (delta: 321.4 MB). Free memory was 597.1 MB in the beginning and 861.6 MB in the end (delta: -264.5 MB). Peak memory consumption was 510.4 MB. Max. memory is 50.3 GB. 78.21/43.37 * BuchiAutomizer took 3353.65 ms. Allocated memory was 996.7 MB in the beginning and 1.0 GB in the end (delta: 4.2 MB). Free memory was 861.6 MB in the beginning and 781.4 MB in the end (delta: 80.2 MB). Peak memory consumption was 84.4 MB. Max. memory is 50.3 GB. 78.21/43.37 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #memory_int 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 - GenericResult: Unfinished Backtranslation 78.21/43.37 unknown boogie variable #length 78.21/43.37 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 78.21/43.37 - PositiveResult [Line: 40]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 16]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 31]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 16]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 39]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 16]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 40]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 16]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 34]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 34]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 39]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 31]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 31]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - PositiveResult [Line: 31]: pointer dereference always succeeds 78.21/43.37 For all program executions holds that pointer dereference always succeeds at this location 78.21/43.37 - AllSpecificationsHoldResult: All specifications hold 78.21/43.37 14 specifications checked. All of them hold 78.21/43.37 - InvariantResult [Line: 16]: Loop Invariant 78.21/43.37 [2019-03-28 11:59:25,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,169 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 78.21/43.37 - InvariantResult [Line: 31]: Loop Invariant 78.21/43.37 [2019-03-28 11:59:25,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 Derived loop invariant: (((((((((\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1]) && !(nondetString == __VERIFIER_nondet_String())) && ((((((((1 <= unknown-#length-unknown[s2] && 0 == s2) && ((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && 0 == s1) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) || (((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 <= s1) && !(nondetString == __VERIFIER_nondet_String())) && (((((1 <= length && nondetString == 0) && n + 1 <= 0) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s1]) && \valid[nondetString] == 1) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 <= s2)) || ((((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1])) && (((((((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25)) && 1 <= s1) && 1 <= s2) && s1 + 1 <= unknown-#length-unknown[s1]) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && s2 + 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1])) || ((1 == length && ((((((((1 <= unknown-#length-unknown[s2] && 0 == s2) && ((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && 0 == s1) && unknown-#memory_int-unknown[s2][s2] == 0)) || (((((((((((((0 == s2 && 1 <= length) && nondetString == 0) && n + 1 <= 0) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 0 == s1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) && 1 == \valid[__VERIFIER_nondet_String()]) 78.21/43.37 - InvariantResult [Line: 16]: Loop Invariant 78.21/43.37 [2019-03-28 11:59:25,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] 78.21/43.37 [2019-03-28 11:59:25,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 [2019-03-28 11:59:25,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 78.21/43.37 [2019-03-28 11:59:25,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 78.21/43.37 Derived loop invariant: ((((((1 == length && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && \valid[nondetString] == 1) || (!(nondetString == __VERIFIER_nondet_String()) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1]) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) && ((((1 <= length && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && \valid[nondetString] == 1) 78.21/43.37 - StatisticsResult: Ultimate Automizer benchmark data 78.21/43.37 CFG has 1 procedures, 34 locations, 14 error locations. SAFE Result, 34.5s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 275 SDtfs, 3568 SDslu, 2325 SDs, 0 SdLazy, 4697 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 296 SyntacticMatches, 3 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=21, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 800 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 610 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1054245 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 59332 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 787 ConstructedInterpolants, 157 QuantifiedInterpolants, 350505 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1808 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 148/383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 78.21/43.37 - StatisticsResult: Constructed decomposition of program 78.21/43.37 Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[__VERIFIER_nondet_String()] and consists of 9 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. 78.21/43.37 - StatisticsResult: Timing statistics 78.21/43.37 BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 69 SDtfs, 278 SDslu, 275 SDs, 0 SdLazy, 481 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf100 lsp89 ukn84 mio100 lsp42 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 78.21/43.37 - TerminationAnalysisResult: Termination proven 78.21/43.37 Buchi Automizer proved that your program is terminating 78.21/43.37 RESULT: Ultimate proved your program to be correct! 78.21/43.37 !SESSION 2019-03-28 11:58:42.855 ----------------------------------------------- 78.21/43.37 eclipse.buildId=unknown 78.21/43.37 java.version=1.8.0_181 78.21/43.37 java.vendor=Oracle Corporation 78.21/43.37 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 78.21/43.37 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 78.21/43.37 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 78.21/43.37 78.21/43.37 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:59:25.440 78.21/43.37 !MESSAGE The workspace will exit with unsaved changes in this session. 78.21/43.37 Received shutdown request... 78.21/43.37 Ultimate: 78.21/43.37 GTK+ Version Check 78.21/43.37 EOF