66.56/35.78 YES 66.56/35.78 66.56/35.78 Ultimate: Cannot open display: 66.56/35.78 This is Ultimate 0.1.24-8dc7c08-m 66.56/35.78 [2019-03-28 12:44:14,110 INFO L170 SettingsManager]: Resetting all preferences to default values... 66.56/35.78 [2019-03-28 12:44:14,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 66.56/35.78 [2019-03-28 12:44:14,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 66.56/35.78 [2019-03-28 12:44:14,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 66.56/35.78 [2019-03-28 12:44:14,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 66.56/35.78 [2019-03-28 12:44:14,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 66.56/35.78 [2019-03-28 12:44:14,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 66.56/35.78 [2019-03-28 12:44:14,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 66.56/35.78 [2019-03-28 12:44:14,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 66.56/35.78 [2019-03-28 12:44:14,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 66.56/35.78 [2019-03-28 12:44:14,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 66.56/35.78 [2019-03-28 12:44:14,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 66.56/35.78 [2019-03-28 12:44:14,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 66.56/35.78 [2019-03-28 12:44:14,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 66.56/35.78 [2019-03-28 12:44:14,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 66.56/35.78 [2019-03-28 12:44:14,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 66.56/35.78 [2019-03-28 12:44:14,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 66.56/35.78 [2019-03-28 12:44:14,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 66.56/35.78 [2019-03-28 12:44:14,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 66.56/35.78 [2019-03-28 12:44:14,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 66.56/35.78 [2019-03-28 12:44:14,146 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 66.56/35.78 [2019-03-28 12:44:14,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 66.56/35.78 [2019-03-28 12:44:14,147 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 66.56/35.78 [2019-03-28 12:44:14,148 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 66.56/35.78 [2019-03-28 12:44:14,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 66.56/35.78 [2019-03-28 12:44:14,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 66.56/35.78 [2019-03-28 12:44:14,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 66.56/35.78 [2019-03-28 12:44:14,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 66.56/35.78 [2019-03-28 12:44:14,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 66.56/35.78 [2019-03-28 12:44:14,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 66.56/35.78 [2019-03-28 12:44:14,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 66.56/35.78 [2019-03-28 12:44:14,154 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 66.56/35.78 [2019-03-28 12:44:14,169 INFO L110 SettingsManager]: Loading preferences was successful 66.56/35.78 [2019-03-28 12:44:14,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 66.56/35.78 [2019-03-28 12:44:14,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 66.56/35.78 [2019-03-28 12:44:14,170 INFO L133 SettingsManager]: * Rewrite not-equals=true 66.56/35.78 [2019-03-28 12:44:14,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 66.56/35.78 [2019-03-28 12:44:14,170 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 66.56/35.78 [2019-03-28 12:44:14,171 INFO L133 SettingsManager]: * Use SBE=true 66.56/35.78 [2019-03-28 12:44:14,171 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 66.56/35.78 [2019-03-28 12:44:14,171 INFO L133 SettingsManager]: * Use old map elimination=false 66.56/35.78 [2019-03-28 12:44:14,171 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 66.56/35.78 [2019-03-28 12:44:14,171 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 66.56/35.78 [2019-03-28 12:44:14,172 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 66.56/35.78 [2019-03-28 12:44:14,172 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 66.56/35.78 [2019-03-28 12:44:14,172 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 66.56/35.78 [2019-03-28 12:44:14,172 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 66.56/35.78 [2019-03-28 12:44:14,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 66.56/35.78 [2019-03-28 12:44:14,172 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 66.56/35.78 [2019-03-28 12:44:14,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE 66.56/35.78 [2019-03-28 12:44:14,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 66.56/35.78 [2019-03-28 12:44:14,173 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 66.56/35.78 [2019-03-28 12:44:14,173 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 66.56/35.78 [2019-03-28 12:44:14,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 66.56/35.78 [2019-03-28 12:44:14,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 66.56/35.78 [2019-03-28 12:44:14,174 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 66.56/35.78 [2019-03-28 12:44:14,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 66.56/35.78 [2019-03-28 12:44:14,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 66.56/35.78 [2019-03-28 12:44:14,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 66.56/35.78 [2019-03-28 12:44:14,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 66.56/35.78 [2019-03-28 12:44:14,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 66.56/35.78 [2019-03-28 12:44:14,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 66.56/35.78 [2019-03-28 12:44:14,214 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 66.56/35.78 [2019-03-28 12:44:14,217 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 66.56/35.78 [2019-03-28 12:44:14,219 INFO L271 PluginConnector]: Initializing CDTParser... 66.56/35.78 [2019-03-28 12:44:14,219 INFO L276 PluginConnector]: CDTParser initialized 66.56/35.78 [2019-03-28 12:44:14,220 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 66.56/35.78 [2019-03-28 12:44:14,310 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/701d00e768844e6da0394c539c203527/FLAGe00cd1dcc 66.56/35.78 [2019-03-28 12:44:14,682 INFO L307 CDTParser]: Found 1 translation units. 66.56/35.78 [2019-03-28 12:44:14,683 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 66.56/35.78 [2019-03-28 12:44:14,683 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 66.56/35.78 [2019-03-28 12:44:14,691 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/701d00e768844e6da0394c539c203527/FLAGe00cd1dcc 66.56/35.78 [2019-03-28 12:44:15,073 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/701d00e768844e6da0394c539c203527 66.56/35.78 [2019-03-28 12:44:15,085 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 66.56/35.78 [2019-03-28 12:44:15,087 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 66.56/35.78 [2019-03-28 12:44:15,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 66.56/35.78 [2019-03-28 12:44:15,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 66.56/35.78 [2019-03-28 12:44:15,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 66.56/35.78 [2019-03-28 12:44:15,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5a60fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15, skipping insertion in model container 66.56/35.78 [2019-03-28 12:44:15,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 66.56/35.78 [2019-03-28 12:44:15,122 INFO L176 MainTranslator]: Built tables and reachable declarations 66.56/35.78 [2019-03-28 12:44:15,291 INFO L206 PostProcessor]: Analyzing one entry point: main 66.56/35.78 [2019-03-28 12:44:15,303 INFO L191 MainTranslator]: Completed pre-run 66.56/35.78 [2019-03-28 12:44:15,323 INFO L206 PostProcessor]: Analyzing one entry point: main 66.56/35.78 [2019-03-28 12:44:15,403 INFO L195 MainTranslator]: Completed translation 66.56/35.78 [2019-03-28 12:44:15,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15 WrapperNode 66.56/35.78 [2019-03-28 12:44:15,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 66.56/35.78 [2019-03-28 12:44:15,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 66.56/35.78 [2019-03-28 12:44:15,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 66.56/35.78 [2019-03-28 12:44:15,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 66.56/35.78 [2019-03-28 12:44:15,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 66.56/35.78 [2019-03-28 12:44:15,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 66.56/35.78 [2019-03-28 12:44:15,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 66.56/35.78 [2019-03-28 12:44:15,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized 66.56/35.78 [2019-03-28 12:44:15,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 66.56/35.78 [2019-03-28 12:44:15,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 66.56/35.78 [2019-03-28 12:44:15,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... 66.56/35.78 [2019-03-28 12:44:15,476 INFO L276 PluginConnector]: RCFGBuilder initialized 66.56/35.78 [2019-03-28 12:44:15,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (1/1) ... 66.56/35.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.78 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 66.56/35.78 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 66.56/35.78 [2019-03-28 12:44:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 66.56/35.78 [2019-03-28 12:44:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 66.56/35.78 [2019-03-28 12:44:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 66.56/35.78 [2019-03-28 12:44:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 66.56/35.78 [2019-03-28 12:44:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 66.56/35.78 [2019-03-28 12:44:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 66.56/35.78 [2019-03-28 12:44:15,811 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 66.56/35.78 [2019-03-28 12:44:15,811 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 66.56/35.78 [2019-03-28 12:44:15,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:15 BoogieIcfgContainer 66.56/35.78 [2019-03-28 12:44:15,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 66.56/35.78 [2019-03-28 12:44:15,813 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 66.56/35.78 [2019-03-28 12:44:15,814 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 66.56/35.78 [2019-03-28 12:44:15,816 INFO L276 PluginConnector]: BlockEncodingV2 initialized 66.56/35.78 [2019-03-28 12:44:15,817 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:15" (1/1) ... 66.56/35.78 [2019-03-28 12:44:15,841 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 46 edges 66.56/35.78 [2019-03-28 12:44:15,842 INFO L258 BlockEncoder]: Using Remove infeasible edges 66.56/35.78 [2019-03-28 12:44:15,843 INFO L263 BlockEncoder]: Using Maximize final states 66.56/35.78 [2019-03-28 12:44:15,844 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 66.56/35.78 [2019-03-28 12:44:15,844 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 66.56/35.78 [2019-03-28 12:44:15,846 INFO L296 BlockEncoder]: Using Remove sink states 66.56/35.78 [2019-03-28 12:44:15,847 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 66.56/35.78 [2019-03-28 12:44:15,847 INFO L179 BlockEncoder]: Using Rewrite not-equals 66.56/35.78 [2019-03-28 12:44:15,873 INFO L185 BlockEncoder]: Using Use SBE 66.56/35.78 [2019-03-28 12:44:15,903 INFO L200 BlockEncoder]: SBE split 19 edges 66.56/35.78 [2019-03-28 12:44:15,908 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 66.56/35.78 [2019-03-28 12:44:15,910 INFO L71 MaximizeFinalStates]: 0 new accepting states 66.56/35.78 [2019-03-28 12:44:15,942 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 66.56/35.78 [2019-03-28 12:44:15,945 INFO L70 RemoveSinkStates]: Removed 6 edges and 3 locations by removing sink states 66.56/35.78 [2019-03-28 12:44:15,948 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 66.56/35.78 [2019-03-28 12:44:15,948 INFO L71 MaximizeFinalStates]: 0 new accepting states 66.56/35.78 [2019-03-28 12:44:15,948 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 66.56/35.78 [2019-03-28 12:44:15,949 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 66.56/35.78 [2019-03-28 12:44:15,950 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges 66.56/35.78 [2019-03-28 12:44:15,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:15 BasicIcfg 66.56/35.78 [2019-03-28 12:44:15,950 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 66.56/35.78 [2019-03-28 12:44:15,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 66.56/35.78 [2019-03-28 12:44:15,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... 66.56/35.78 [2019-03-28 12:44:15,955 INFO L276 PluginConnector]: TraceAbstraction initialized 66.56/35.78 [2019-03-28 12:44:15,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:15" (1/4) ... 66.56/35.78 [2019-03-28 12:44:15,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23704fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:15, skipping insertion in model container 66.56/35.78 [2019-03-28 12:44:15,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (2/4) ... 66.56/35.78 [2019-03-28 12:44:15,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23704fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:15, skipping insertion in model container 66.56/35.78 [2019-03-28 12:44:15,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:15" (3/4) ... 66.56/35.78 [2019-03-28 12:44:15,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23704fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:15, skipping insertion in model container 66.56/35.78 [2019-03-28 12:44:15,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:15" (4/4) ... 66.56/35.78 [2019-03-28 12:44:15,959 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 66.56/35.78 [2019-03-28 12:44:15,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 66.56/35.78 [2019-03-28 12:44:15,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 66.56/35.78 [2019-03-28 12:44:15,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 66.56/35.78 [2019-03-28 12:44:16,024 INFO L133 ementStrategyFactory]: Using default assertion order modulation 66.56/35.78 [2019-03-28 12:44:16,025 INFO L382 AbstractCegarLoop]: Interprodecural is true 66.56/35.78 [2019-03-28 12:44:16,025 INFO L383 AbstractCegarLoop]: Hoare is true 66.56/35.78 [2019-03-28 12:44:16,025 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 66.56/35.78 [2019-03-28 12:44:16,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 66.56/35.78 [2019-03-28 12:44:16,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 66.56/35.78 [2019-03-28 12:44:16,026 INFO L387 AbstractCegarLoop]: Difference is false 66.56/35.78 [2019-03-28 12:44:16,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 66.56/35.78 [2019-03-28 12:44:16,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 66.56/35.78 [2019-03-28 12:44:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. 66.56/35.78 [2019-03-28 12:44:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.56/35.78 [2019-03-28 12:44:16,048 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:16,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:16,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash 200436536, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:16,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.56/35.78 [2019-03-28 12:44:16,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.56/35.78 [2019-03-28 12:44:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.56/35.78 [2019-03-28 12:44:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.56/35.78 [2019-03-28 12:44:16,263 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. 66.56/35.78 [2019-03-28 12:44:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:16,398 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. 66.56/35.78 [2019-03-28 12:44:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:16,413 INFO L225 Difference]: With dead ends: 30 66.56/35.78 [2019-03-28 12:44:16,414 INFO L226 Difference]: Without dead ends: 29 66.56/35.78 [2019-03-28 12:44:16,417 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 66.56/35.78 [2019-03-28 12:44:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 66.56/35.78 [2019-03-28 12:44:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 66.56/35.78 [2019-03-28 12:44:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 66.56/35.78 [2019-03-28 12:44:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:16,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,458 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:16,459 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:16,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.56/35.78 [2019-03-28 12:44:16,459 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:16,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:16,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash 200436538, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:16,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:16,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:16,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.56/35.78 [2019-03-28 12:44:16,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.56/35.78 [2019-03-28 12:44:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.56/35.78 [2019-03-28 12:44:16,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.56/35.78 [2019-03-28 12:44:16,517 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 3 states. 66.56/35.78 [2019-03-28 12:44:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:16,608 INFO L93 Difference]: Finished difference Result 30 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:16,610 INFO L225 Difference]: With dead ends: 30 66.56/35.78 [2019-03-28 12:44:16,610 INFO L226 Difference]: Without dead ends: 29 66.56/35.78 [2019-03-28 12:44:16,611 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 66.56/35.78 [2019-03-28 12:44:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 66.56/35.78 [2019-03-28 12:44:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 66.56/35.78 [2019-03-28 12:44:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 66.56/35.78 [2019-03-28 12:44:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. 66.56/35.78 [2019-03-28 12:44:16,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 50 transitions. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:16,617 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 50 transitions. 66.56/35.78 [2019-03-28 12:44:16,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 50 transitions. 66.56/35.78 [2019-03-28 12:44:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 66.56/35.78 [2019-03-28 12:44:16,618 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:16,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:16,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 200436539, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:16,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:16,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:16,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:16,668 INFO L87 Difference]: Start difference. First operand 29 states and 50 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:16,767 INFO L93 Difference]: Finished difference Result 29 states and 50 transitions. 66.56/35.78 [2019-03-28 12:44:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:16,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:16,768 INFO L225 Difference]: With dead ends: 29 66.56/35.78 [2019-03-28 12:44:16,768 INFO L226 Difference]: Without dead ends: 28 66.56/35.78 [2019-03-28 12:44:16,769 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 66.56/35.78 [2019-03-28 12:44:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 66.56/35.78 [2019-03-28 12:44:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 66.56/35.78 [2019-03-28 12:44:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.56/35.78 [2019-03-28 12:44:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. 66.56/35.78 [2019-03-28 12:44:16,773 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 5 66.56/35.78 [2019-03-28 12:44:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:16,774 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. 66.56/35.78 [2019-03-28 12:44:16,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. 66.56/35.78 [2019-03-28 12:44:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.56/35.78 [2019-03-28 12:44:16,775 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:16,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:16,775 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564540, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:16,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:16,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:16,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:16,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:16,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.56/35.78 [2019-03-28 12:44:16,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.56/35.78 [2019-03-28 12:44:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.56/35.78 [2019-03-28 12:44:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.56/35.78 [2019-03-28 12:44:16,806 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. 66.56/35.78 [2019-03-28 12:44:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:16,872 INFO L93 Difference]: Finished difference Result 28 states and 49 transitions. 66.56/35.78 [2019-03-28 12:44:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 66.56/35.78 [2019-03-28 12:44:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:16,874 INFO L225 Difference]: With dead ends: 28 66.56/35.78 [2019-03-28 12:44:16,874 INFO L226 Difference]: Without dead ends: 27 66.56/35.78 [2019-03-28 12:44:16,874 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 66.56/35.78 [2019-03-28 12:44:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 66.56/35.78 [2019-03-28 12:44:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:16,878 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 6 66.56/35.78 [2019-03-28 12:44:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:16,879 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:16,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.56/35.78 [2019-03-28 12:44:16,880 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:16,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:16,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564542, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:16,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:16,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 66.56/35.78 [2019-03-28 12:44:16,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 66.56/35.78 [2019-03-28 12:44:16,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 66.56/35.78 [2019-03-28 12:44:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 66.56/35.78 [2019-03-28 12:44:16,916 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 3 states. 66.56/35.78 [2019-03-28 12:44:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,000 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:17,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:17,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 66.56/35.78 [2019-03-28 12:44:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,001 INFO L225 Difference]: With dead ends: 28 66.56/35.78 [2019-03-28 12:44:17,001 INFO L226 Difference]: Without dead ends: 27 66.56/35.78 [2019-03-28 12:44:17,002 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 66.56/35.78 [2019-03-28 12:44:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 66.56/35.78 [2019-03-28 12:44:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. 66.56/35.78 [2019-03-28 12:44:17,006 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 6 66.56/35.78 [2019-03-28 12:44:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,006 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. 66.56/35.78 [2019-03-28 12:44:17,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 66.56/35.78 [2019-03-28 12:44:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. 66.56/35.78 [2019-03-28 12:44:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 66.56/35.78 [2019-03-28 12:44:17,007 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564543, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:17,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:17,039 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,109 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. 66.56/35.78 [2019-03-28 12:44:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 66.56/35.78 [2019-03-28 12:44:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,111 INFO L225 Difference]: With dead ends: 27 66.56/35.78 [2019-03-28 12:44:17,111 INFO L226 Difference]: Without dead ends: 26 66.56/35.78 [2019-03-28 12:44:17,111 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 66.56/35.78 [2019-03-28 12:44:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 66.56/35.78 [2019-03-28 12:44:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,116 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 6 66.56/35.78 [2019-03-28 12:44:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,116 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.56/35.78 [2019-03-28 12:44:17,117 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,117 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589599, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:17,163 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,245 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,247 INFO L225 Difference]: With dead ends: 26 66.56/35.78 [2019-03-28 12:44:17,247 INFO L226 Difference]: Without dead ends: 24 66.56/35.78 [2019-03-28 12:44:17,247 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 66.56/35.78 [2019-03-28 12:44:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 66.56/35.78 [2019-03-28 12:44:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 66.56/35.78 [2019-03-28 12:44:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 66.56/35.78 [2019-03-28 12:44:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:17,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,251 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:17,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.56/35.78 [2019-03-28 12:44:17,252 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589601, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:17,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:17,298 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,394 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. 66.56/35.78 [2019-03-28 12:44:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,395 INFO L225 Difference]: With dead ends: 37 66.56/35.78 [2019-03-28 12:44:17,395 INFO L226 Difference]: Without dead ends: 35 66.56/35.78 [2019-03-28 12:44:17,396 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 66.56/35.78 [2019-03-28 12:44:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 66.56/35.78 [2019-03-28 12:44:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. 66.56/35.78 [2019-03-28 12:44:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.56/35.78 [2019-03-28 12:44:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. 66.56/35.78 [2019-03-28 12:44:17,401 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,401 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 53 transitions. 66.56/35.78 [2019-03-28 12:44:17,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. 66.56/35.78 [2019-03-28 12:44:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 66.56/35.78 [2019-03-28 12:44:17,402 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589602, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 66.56/35.78 [2019-03-28 12:44:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 66.56/35.78 [2019-03-28 12:44:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 66.56/35.78 [2019-03-28 12:44:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 66.56/35.78 [2019-03-28 12:44:17,472 INFO L87 Difference]: Start difference. First operand 28 states and 53 transitions. Second operand 6 states. 66.56/35.78 [2019-03-28 12:44:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,594 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. 66.56/35.78 [2019-03-28 12:44:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.56/35.78 [2019-03-28 12:44:17,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,595 INFO L225 Difference]: With dead ends: 35 66.56/35.78 [2019-03-28 12:44:17,595 INFO L226 Difference]: Without dead ends: 33 66.56/35.78 [2019-03-28 12:44:17,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 66.56/35.78 [2019-03-28 12:44:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 66.56/35.78 [2019-03-28 12:44:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. 66.56/35.78 [2019-03-28 12:44:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.56/35.78 [2019-03-28 12:44:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:17,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 8 66.56/35.78 [2019-03-28 12:44:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,600 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:17,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 66.56/35.78 [2019-03-28 12:44:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 66.56/35.78 [2019-03-28 12:44:17,601 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,601 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427036, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:17,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:17,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:17,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:17,637 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,710 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. 66.56/35.78 [2019-03-28 12:44:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 66.56/35.78 [2019-03-28 12:44:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,712 INFO L225 Difference]: With dead ends: 28 66.56/35.78 [2019-03-28 12:44:17,712 INFO L226 Difference]: Without dead ends: 27 66.56/35.78 [2019-03-28 12:44:17,712 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 66.56/35.78 [2019-03-28 12:44:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 66.56/35.78 [2019-03-28 12:44:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:17,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 9 66.56/35.78 [2019-03-28 12:44:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,716 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:17,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 66.56/35.78 [2019-03-28 12:44:17,718 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427034, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 66.56/35.78 [2019-03-28 12:44:17,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 66.56/35.78 [2019-03-28 12:44:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 66.56/35.78 [2019-03-28 12:44:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 66.56/35.78 [2019-03-28 12:44:17,793 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 6 states. 66.56/35.78 [2019-03-28 12:44:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:17,937 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 66.56/35.78 [2019-03-28 12:44:17,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 66.56/35.78 [2019-03-28 12:44:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:17,938 INFO L225 Difference]: With dead ends: 28 66.56/35.78 [2019-03-28 12:44:17,938 INFO L226 Difference]: Without dead ends: 27 66.56/35.78 [2019-03-28 12:44:17,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 66.56/35.78 [2019-03-28 12:44:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 66.56/35.78 [2019-03-28 12:44:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 9 66.56/35.78 [2019-03-28 12:44:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:17,943 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 66.56/35.78 [2019-03-28 12:44:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.56/35.78 [2019-03-28 12:44:17,944 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:17,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:17,944 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187237, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:17,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:17,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:17,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:17,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:17,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:17,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:17,976 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,044 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. 66.56/35.78 [2019-03-28 12:44:18,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,045 INFO L225 Difference]: With dead ends: 27 66.56/35.78 [2019-03-28 12:44:18,046 INFO L226 Difference]: Without dead ends: 26 66.56/35.78 [2019-03-28 12:44:18,046 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 66.56/35.78 [2019-03-28 12:44:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 66.56/35.78 [2019-03-28 12:44:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. 66.56/35.78 [2019-03-28 12:44:18,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,050 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. 66.56/35.78 [2019-03-28 12:44:18,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. 66.56/35.78 [2019-03-28 12:44:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.56/35.78 [2019-03-28 12:44:18,051 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,051 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187235, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:18,086 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,158 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. 66.56/35.78 [2019-03-28 12:44:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,159 INFO L225 Difference]: With dead ends: 28 66.56/35.78 [2019-03-28 12:44:18,159 INFO L226 Difference]: Without dead ends: 26 66.56/35.78 [2019-03-28 12:44:18,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 66.56/35.78 [2019-03-28 12:44:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:18,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:18,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. 66.56/35.78 [2019-03-28 12:44:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 66.56/35.78 [2019-03-28 12:44:18,164 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,164 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187234, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 66.56/35.78 [2019-03-28 12:44:18,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 66.56/35.78 [2019-03-28 12:44:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 66.56/35.78 [2019-03-28 12:44:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 66.56/35.78 [2019-03-28 12:44:18,206 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. Second operand 5 states. 66.56/35.78 [2019-03-28 12:44:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,299 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. 66.56/35.78 [2019-03-28 12:44:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.56/35.78 [2019-03-28 12:44:18,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,300 INFO L225 Difference]: With dead ends: 31 66.56/35.78 [2019-03-28 12:44:18,300 INFO L226 Difference]: Without dead ends: 30 66.56/35.78 [2019-03-28 12:44:18,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 66.56/35.78 [2019-03-28 12:44:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 66.56/35.78 [2019-03-28 12:44:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. 66.56/35.78 [2019-03-28 12:44:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 66.56/35.78 [2019-03-28 12:44:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. 66.56/35.78 [2019-03-28 12:44:18,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 11 66.56/35.78 [2019-03-28 12:44:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,305 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. 66.56/35.78 [2019-03-28 12:44:18,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 66.56/35.78 [2019-03-28 12:44:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. 66.56/35.78 [2019-03-28 12:44:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 66.56/35.78 [2019-03-28 12:44:18,305 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,306 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059446, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:18,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:18,340 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,408 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. 66.56/35.78 [2019-03-28 12:44:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,458 INFO L225 Difference]: With dead ends: 27 66.56/35.78 [2019-03-28 12:44:18,459 INFO L226 Difference]: Without dead ends: 26 66.56/35.78 [2019-03-28 12:44:18,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 66.56/35.78 [2019-03-28 12:44:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 66.56/35.78 [2019-03-28 12:44:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. 66.56/35.78 [2019-03-28 12:44:18,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,463 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. 66.56/35.78 [2019-03-28 12:44:18,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.78 [2019-03-28 12:44:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. 66.56/35.78 [2019-03-28 12:44:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 66.56/35.78 [2019-03-28 12:44:18,464 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,464 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059444, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 66.56/35.78 [2019-03-28 12:44:18,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 66.56/35.78 [2019-03-28 12:44:18,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 66.56/35.78 [2019-03-28 12:44:18,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 66.56/35.78 [2019-03-28 12:44:18,520 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 7 states. 66.56/35.78 [2019-03-28 12:44:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,640 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. 66.56/35.78 [2019-03-28 12:44:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 66.56/35.78 [2019-03-28 12:44:18,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,641 INFO L225 Difference]: With dead ends: 27 66.56/35.78 [2019-03-28 12:44:18,641 INFO L226 Difference]: Without dead ends: 26 66.56/35.78 [2019-03-28 12:44:18,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 66.56/35.78 [2019-03-28 12:44:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 66.56/35.78 [2019-03-28 12:44:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 66.56/35.78 [2019-03-28 12:44:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. 66.56/35.78 [2019-03-28 12:44:18,645 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,645 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 39 transitions. 66.56/35.78 [2019-03-28 12:44:18,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 66.56/35.78 [2019-03-28 12:44:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. 66.56/35.78 [2019-03-28 12:44:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 66.56/35.78 [2019-03-28 12:44:18,646 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,646 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059443, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 66.56/35.78 [2019-03-28 12:44:18,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 66.56/35.78 [2019-03-28 12:44:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.56/35.78 [2019-03-28 12:44:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 66.56/35.78 [2019-03-28 12:44:18,722 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. Second operand 8 states. 66.56/35.78 [2019-03-28 12:44:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:18,921 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. 66.56/35.78 [2019-03-28 12:44:18,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 66.56/35.78 [2019-03-28 12:44:18,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:18,922 INFO L225 Difference]: With dead ends: 33 66.56/35.78 [2019-03-28 12:44:18,922 INFO L226 Difference]: Without dead ends: 30 66.56/35.78 [2019-03-28 12:44:18,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 66.56/35.78 [2019-03-28 12:44:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 66.56/35.78 [2019-03-28 12:44:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. 66.56/35.78 [2019-03-28 12:44:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 66.56/35.78 [2019-03-28 12:44:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. 66.56/35.78 [2019-03-28 12:44:18,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 12 66.56/35.78 [2019-03-28 12:44:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:18,926 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. 66.56/35.78 [2019-03-28 12:44:18,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 66.56/35.78 [2019-03-28 12:44:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. 66.56/35.78 [2019-03-28 12:44:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 66.56/35.78 [2019-03-28 12:44:18,927 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.78 [2019-03-28 12:44:18,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.78 [2019-03-28 12:44:18,927 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.78 [2019-03-28 12:44:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.78 [2019-03-28 12:44:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash -55512069, now seen corresponding path program 1 times 66.56/35.78 [2019-03-28 12:44:18,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.78 [2019-03-28 12:44:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.78 [2019-03-28 12:44:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.78 [2019-03-28 12:44:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.78 [2019-03-28 12:44:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.78 [2019-03-28 12:44:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.78 [2019-03-28 12:44:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.78 [2019-03-28 12:44:18,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.78 [2019-03-28 12:44:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.78 [2019-03-28 12:44:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.78 [2019-03-28 12:44:18,962 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. 66.56/35.78 [2019-03-28 12:44:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.78 [2019-03-28 12:44:19,039 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. 66.56/35.78 [2019-03-28 12:44:19,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 66.56/35.78 [2019-03-28 12:44:19,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 66.56/35.78 [2019-03-28 12:44:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.78 [2019-03-28 12:44:19,040 INFO L225 Difference]: With dead ends: 26 66.56/35.78 [2019-03-28 12:44:19,040 INFO L226 Difference]: Without dead ends: 24 66.56/35.78 [2019-03-28 12:44:19,040 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 66.56/35.78 [2019-03-28 12:44:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 66.56/35.78 [2019-03-28 12:44:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 66.56/35.78 [2019-03-28 12:44:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 66.56/35.78 [2019-03-28 12:44:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. 66.56/35.78 [2019-03-28 12:44:19,043 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 66.56/35.78 [2019-03-28 12:44:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.78 [2019-03-28 12:44:19,043 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. 66.56/35.78 [2019-03-28 12:44:19,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.79 [2019-03-28 12:44:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. 66.56/35.79 [2019-03-28 12:44:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 66.56/35.79 [2019-03-28 12:44:19,044 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:19,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:19,045 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:19,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash -55512068, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:19,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:19,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:19,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:19,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:19,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:19,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:19,371 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 66.56/35.79 [2019-03-28 12:44:19,372 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,378 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:19,379 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,379 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 66.56/35.79 [2019-03-28 12:44:19,411 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 66.56/35.79 [2019-03-28 12:44:19,411 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,420 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:19,422 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. 66.56/35.79 [2019-03-28 12:44:19,422 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 66.56/35.79 [2019-03-28 12:44:19,466 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 25 treesize of output 24 66.56/35.79 [2019-03-28 12:44:19,467 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,481 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:19,483 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. 66.56/35.79 [2019-03-28 12:44:19,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 66.56/35.79 [2019-03-28 12:44:19,591 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:19,592 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 28 treesize of output 21 66.56/35.79 [2019-03-28 12:44:19,595 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,609 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:19,616 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:19,616 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:23 66.56/35.79 [2019-03-28 12:44:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:19,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 66.56/35.79 [2019-03-28 12:44:19,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states 66.56/35.79 [2019-03-28 12:44:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. 66.56/35.79 [2019-03-28 12:44:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 66.56/35.79 [2019-03-28 12:44:19,693 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 14 states. 66.56/35.79 [2019-03-28 12:44:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:20,334 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. 66.56/35.79 [2019-03-28 12:44:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 66.56/35.79 [2019-03-28 12:44:20,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 66.56/35.79 [2019-03-28 12:44:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:20,335 INFO L225 Difference]: With dead ends: 29 66.56/35.79 [2019-03-28 12:44:20,335 INFO L226 Difference]: Without dead ends: 28 66.56/35.79 [2019-03-28 12:44:20,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 66.56/35.79 [2019-03-28 12:44:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 66.56/35.79 [2019-03-28 12:44:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 66.56/35.79 [2019-03-28 12:44:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.56/35.79 [2019-03-28 12:44:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:20,340 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 66.56/35.79 [2019-03-28 12:44:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:20,340 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:20,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. 66.56/35.79 [2019-03-28 12:44:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 66.56/35.79 [2019-03-28 12:44:20,341 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:20,341 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:20,341 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873140, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:20,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:20,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:20,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:20,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:20,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:20,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:20,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 36 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:20,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:20,673 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 66.56/35.79 [2019-03-28 12:44:20,673 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:20,684 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:20,685 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. 66.56/35.79 [2019-03-28 12:44:20,685 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 66.56/35.79 [2019-03-28 12:44:20,891 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:20,891 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 66.56/35.79 [2019-03-28 12:44:20,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:20,957 INFO L497 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size 66.56/35.79 [2019-03-28 12:44:20,965 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:20,965 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:23 66.56/35.79 [2019-03-28 12:44:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:21,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 66.56/35.79 [2019-03-28 12:44:21,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 66.56/35.79 [2019-03-28 12:44:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 66.56/35.79 [2019-03-28 12:44:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 66.56/35.79 [2019-03-28 12:44:21,044 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 16 states. 66.56/35.79 [2019-03-28 12:44:21,602 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 66.56/35.79 [2019-03-28 12:44:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:22,018 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. 66.56/35.79 [2019-03-28 12:44:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 66.56/35.79 [2019-03-28 12:44:22,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 66.56/35.79 [2019-03-28 12:44:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:22,019 INFO L225 Difference]: With dead ends: 31 66.56/35.79 [2019-03-28 12:44:22,019 INFO L226 Difference]: Without dead ends: 30 66.56/35.79 [2019-03-28 12:44:22,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 66.56/35.79 [2019-03-28 12:44:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 66.56/35.79 [2019-03-28 12:44:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 66.56/35.79 [2019-03-28 12:44:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 66.56/35.79 [2019-03-28 12:44:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. 66.56/35.79 [2019-03-28 12:44:22,025 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 16 66.56/35.79 [2019-03-28 12:44:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:22,025 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. 66.56/35.79 [2019-03-28 12:44:22,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 66.56/35.79 [2019-03-28 12:44:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. 66.56/35.79 [2019-03-28 12:44:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 66.56/35.79 [2019-03-28 12:44:22,026 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:22,026 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:22,026 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873139, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:22,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:22,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:22,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:22,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:22,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 66.56/35.79 [2019-03-28 12:44:22,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 66.56/35.79 [2019-03-28 12:44:22,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.56/35.79 [2019-03-28 12:44:22,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 66.56/35.79 [2019-03-28 12:44:22,158 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 8 states. 66.56/35.79 [2019-03-28 12:44:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:22,273 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. 66.56/35.79 [2019-03-28 12:44:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 66.56/35.79 [2019-03-28 12:44:22,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 66.56/35.79 [2019-03-28 12:44:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:22,274 INFO L225 Difference]: With dead ends: 30 66.56/35.79 [2019-03-28 12:44:22,274 INFO L226 Difference]: Without dead ends: 29 66.56/35.79 [2019-03-28 12:44:22,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 66.56/35.79 [2019-03-28 12:44:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 66.56/35.79 [2019-03-28 12:44:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 66.56/35.79 [2019-03-28 12:44:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 66.56/35.79 [2019-03-28 12:44:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:22,278 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 66.56/35.79 [2019-03-28 12:44:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:22,279 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:22,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 66.56/35.79 [2019-03-28 12:44:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 66.56/35.79 [2019-03-28 12:44:22,280 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:22,280 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:22,280 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash -196759228, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:22,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:22,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:22,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:22,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.79 [2019-03-28 12:44:22,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 66.56/35.79 [2019-03-28 12:44:22,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.79 [2019-03-28 12:44:22,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.79 [2019-03-28 12:44:22,307 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. 66.56/35.79 [2019-03-28 12:44:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:22,368 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. 66.56/35.79 [2019-03-28 12:44:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.79 [2019-03-28 12:44:22,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 66.56/35.79 [2019-03-28 12:44:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:22,370 INFO L225 Difference]: With dead ends: 29 66.56/35.79 [2019-03-28 12:44:22,370 INFO L226 Difference]: Without dead ends: 28 66.56/35.79 [2019-03-28 12:44:22,370 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 66.56/35.79 [2019-03-28 12:44:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 66.56/35.79 [2019-03-28 12:44:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 66.56/35.79 [2019-03-28 12:44:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 66.56/35.79 [2019-03-28 12:44:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. 66.56/35.79 [2019-03-28 12:44:22,374 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 66.56/35.79 [2019-03-28 12:44:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:22,374 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. 66.56/35.79 [2019-03-28 12:44:22,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 66.56/35.79 [2019-03-28 12:44:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. 66.56/35.79 [2019-03-28 12:44:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 66.56/35.79 [2019-03-28 12:44:22,375 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:22,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:22,375 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1804496921, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:22,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 66.56/35.79 [2019-03-28 12:44:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 66.56/35.79 [2019-03-28 12:44:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 66.56/35.79 [2019-03-28 12:44:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 66.56/35.79 [2019-03-28 12:44:22,428 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 6 states. 66.56/35.79 [2019-03-28 12:44:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:22,540 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. 66.56/35.79 [2019-03-28 12:44:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 66.56/35.79 [2019-03-28 12:44:22,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 66.56/35.79 [2019-03-28 12:44:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:22,541 INFO L225 Difference]: With dead ends: 28 66.56/35.79 [2019-03-28 12:44:22,541 INFO L226 Difference]: Without dead ends: 25 66.56/35.79 [2019-03-28 12:44:22,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 66.56/35.79 [2019-03-28 12:44:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 66.56/35.79 [2019-03-28 12:44:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 66.56/35.79 [2019-03-28 12:44:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 66.56/35.79 [2019-03-28 12:44:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. 66.56/35.79 [2019-03-28 12:44:22,545 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 19 66.56/35.79 [2019-03-28 12:44:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:22,545 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. 66.56/35.79 [2019-03-28 12:44:22,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 66.56/35.79 [2019-03-28 12:44:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. 66.56/35.79 [2019-03-28 12:44:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 66.56/35.79 [2019-03-28 12:44:22,546 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:22,546 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:22,547 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 123238306, now seen corresponding path program 2 times 66.56/35.79 [2019-03-28 12:44:22,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:22,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:22,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 66.56/35.79 [2019-03-28 12:44:22,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 66.56/35.79 [2019-03-28 12:44:22,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:22,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:22,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:22,871 INFO L189 IndexEqualityManager]: detected not equals via solver 66.56/35.79 [2019-03-28 12:44:22,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 66.56/35.79 [2019-03-28 12:44:22,872 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:22,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:22,890 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 66.56/35.79 [2019-03-28 12:44:22,890 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:22,901 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:22,901 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:22,902 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 66.56/35.79 [2019-03-28 12:44:22,939 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 66.56/35.79 [2019-03-28 12:44:22,940 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:22,954 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:22,955 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. 66.56/35.79 [2019-03-28 12:44:22,955 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 66.56/35.79 [2019-03-28 12:44:22,996 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 66.56/35.79 [2019-03-28 12:44:22,997 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:23,007 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:23,009 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. 66.56/35.79 [2019-03-28 12:44:23,009 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 66.56/35.79 [2019-03-28 12:44:23,182 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:23,183 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 66.56/35.79 [2019-03-28 12:44:23,184 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:23,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:23,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:23,200 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 66.56/35.79 [2019-03-28 12:44:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:23,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:23,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 66.56/35.79 [2019-03-28 12:44:23,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 66.56/35.79 [2019-03-28 12:44:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 66.56/35.79 [2019-03-28 12:44:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 66.56/35.79 [2019-03-28 12:44:23,268 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 17 states. 66.56/35.79 [2019-03-28 12:44:23,722 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:23,868 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 66.56/35.79 [2019-03-28 12:44:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:24,598 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. 66.56/35.79 [2019-03-28 12:44:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 66.56/35.79 [2019-03-28 12:44:24,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 66.56/35.79 [2019-03-28 12:44:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:24,599 INFO L225 Difference]: With dead ends: 28 66.56/35.79 [2019-03-28 12:44:24,599 INFO L226 Difference]: Without dead ends: 27 66.56/35.79 [2019-03-28 12:44:24,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 66.56/35.79 [2019-03-28 12:44:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 66.56/35.79 [2019-03-28 12:44:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. 66.56/35.79 [2019-03-28 12:44:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 66.56/35.79 [2019-03-28 12:44:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. 66.56/35.79 [2019-03-28 12:44:24,604 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 22 66.56/35.79 [2019-03-28 12:44:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:24,604 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. 66.56/35.79 [2019-03-28 12:44:24,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 66.56/35.79 [2019-03-28 12:44:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. 66.56/35.79 [2019-03-28 12:44:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 66.56/35.79 [2019-03-28 12:44:24,605 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:24,605 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:24,605 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash -474578842, now seen corresponding path program 2 times 66.56/35.79 [2019-03-28 12:44:24,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:24,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:24,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:25,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:25,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:25,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 66.56/35.79 [2019-03-28 12:44:25,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 66.56/35.79 [2019-03-28 12:44:25,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 46 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:25,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:25,116 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:25,117 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 1 case distinctions, treesize of input 9 treesize of output 25 66.56/35.79 [2019-03-28 12:44:25,117 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:25,139 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 66.56/35.79 [2019-03-28 12:44:25,139 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:25,140 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 66.56/35.79 [2019-03-28 12:44:25,180 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 66.56/35.79 [2019-03-28 12:44:25,181 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:25,189 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:25,190 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. 66.56/35.79 [2019-03-28 12:44:25,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 66.56/35.79 [2019-03-28 12:44:25,438 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:25,439 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 66.56/35.79 [2019-03-28 12:44:25,448 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 66.56/35.79 [2019-03-28 12:44:25,497 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.0 percent of original size 66.56/35.79 [2019-03-28 12:44:25,501 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:25,501 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 66.56/35.79 [2019-03-28 12:44:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:25,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 66.56/35.79 [2019-03-28 12:44:25,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 66.56/35.79 [2019-03-28 12:44:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 66.56/35.79 [2019-03-28 12:44:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 66.56/35.79 [2019-03-28 12:44:25,574 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 20 states. 66.56/35.79 [2019-03-28 12:44:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:27,182 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. 66.56/35.79 [2019-03-28 12:44:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 66.56/35.79 [2019-03-28 12:44:27,182 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 66.56/35.79 [2019-03-28 12:44:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:27,183 INFO L225 Difference]: With dead ends: 36 66.56/35.79 [2019-03-28 12:44:27,183 INFO L226 Difference]: Without dead ends: 35 66.56/35.79 [2019-03-28 12:44:27,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=254, Invalid=1228, Unknown=0, NotChecked=0, Total=1482 66.56/35.79 [2019-03-28 12:44:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 66.56/35.79 [2019-03-28 12:44:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. 66.56/35.79 [2019-03-28 12:44:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 66.56/35.79 [2019-03-28 12:44:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. 66.56/35.79 [2019-03-28 12:44:27,188 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 23 66.56/35.79 [2019-03-28 12:44:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:27,188 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. 66.56/35.79 [2019-03-28 12:44:27,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 66.56/35.79 [2019-03-28 12:44:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. 66.56/35.79 [2019-03-28 12:44:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 66.56/35.79 [2019-03-28 12:44:27,189 INFO L394 BasicCegarLoop]: Found error trace 66.56/35.79 [2019-03-28 12:44:27,189 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:27,190 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 66.56/35.79 [2019-03-28 12:44:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2137451123, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:27,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:27,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:27,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:27,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:27,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:27,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:27,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 59 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:27,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:27,618 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:27,619 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 1 case distinctions, treesize of input 9 treesize of output 25 66.56/35.79 [2019-03-28 12:44:27,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,634 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 66.56/35.79 [2019-03-28 12:44:27,634 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,635 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 66.56/35.79 [2019-03-28 12:44:27,657 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 66.56/35.79 [2019-03-28 12:44:27,658 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,660 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:27,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,661 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 66.56/35.79 [2019-03-28 12:44:27,810 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 66.56/35.79 [2019-03-28 12:44:27,811 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 66.56/35.79 [2019-03-28 12:44:27,820 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,859 INFO L497 ElimStorePlain]: treesize reduction 58, result has 39.6 percent of original size 66.56/35.79 [2019-03-28 12:44:27,861 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 66.56/35.79 [2019-03-28 12:44:27,861 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 66.56/35.79 [2019-03-28 12:44:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:27,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 66.56/35.79 [2019-03-28 12:44:27,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 66.56/35.79 [2019-03-28 12:44:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 66.56/35.79 [2019-03-28 12:44:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 66.56/35.79 [2019-03-28 12:44:27,941 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 20 states. 66.56/35.79 [2019-03-28 12:44:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:28,752 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. 66.56/35.79 [2019-03-28 12:44:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 66.56/35.79 [2019-03-28 12:44:28,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 66.56/35.79 [2019-03-28 12:44:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 66.56/35.79 [2019-03-28 12:44:28,770 INFO L225 Difference]: With dead ends: 31 66.56/35.79 [2019-03-28 12:44:28,770 INFO L226 Difference]: Without dead ends: 0 66.56/35.79 [2019-03-28 12:44:28,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 66.56/35.79 [2019-03-28 12:44:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 66.56/35.79 [2019-03-28 12:44:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 66.56/35.79 [2019-03-28 12:44:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 66.56/35.79 [2019-03-28 12:44:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 66.56/35.79 [2019-03-28 12:44:28,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 66.56/35.79 [2019-03-28 12:44:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. 66.56/35.79 [2019-03-28 12:44:28,771 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 66.56/35.79 [2019-03-28 12:44:28,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 66.56/35.79 [2019-03-28 12:44:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 66.56/35.79 [2019-03-28 12:44:28,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 66.56/35.79 [2019-03-28 12:44:28,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 66.56/35.79 [2019-03-28 12:44:28,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 66.56/35.79 [2019-03-28 12:44:28,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 66.56/35.79 [2019-03-28 12:44:28,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 66.56/35.79 [2019-03-28 12:44:39,314 WARN L188 SmtUtils]: Spent 10.49 s on a formula simplification. DAG size of input: 114 DAG size of output: 86 66.56/35.79 [2019-03-28 12:44:39,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 24 38) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,318 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,319 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 20) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,319 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,319 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 20) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,319 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 20) the Hoare annotation is: (let ((.cse0 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse1 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse5 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base) (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrncmp_~s1.base) (- 1))))))) (.cse8 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (- 1))))))) (.cse9 (= ULTIMATE.start_main_~length1~0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (.cse10 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse12 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse2 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse4 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse14 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (.cse15 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse16 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0))))) (or (and .cse0 .cse1 (<= 1 .cse2) .cse3 (= 1 .cse4) .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_cstrncmp_~s2.offset) .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_cstrncmp_~s1.offset) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset) .cse3 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse2) (= .cse4 1) .cse13 .cse14 .cse15 .cse16))) 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 32) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 19) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 17) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,321 INFO L448 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. 66.56/35.79 [2019-03-28 12:44:39,322 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 66.56/35.79 [2019-03-28 12:44:39,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,334 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,338 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,339 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.56/35.79 [2019-03-28 12:44:39,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:39,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.56/35.79 [2019-03-28 12:44:39,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:39 BasicIcfg 66.56/35.79 [2019-03-28 12:44:39,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 66.56/35.79 [2019-03-28 12:44:39,384 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 66.56/35.79 [2019-03-28 12:44:39,384 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 66.56/35.79 [2019-03-28 12:44:39,387 INFO L276 PluginConnector]: BuchiAutomizer initialized 66.56/35.79 [2019-03-28 12:44:39,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.56/35.79 [2019-03-28 12:44:39,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:15" (1/5) ... 66.56/35.79 [2019-03-28 12:44:39,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4789ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:39, skipping insertion in model container 66.56/35.79 [2019-03-28 12:44:39,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.56/35.79 [2019-03-28 12:44:39,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15" (2/5) ... 66.56/35.79 [2019-03-28 12:44:39,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4789ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:39, skipping insertion in model container 66.56/35.79 [2019-03-28 12:44:39,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.56/35.79 [2019-03-28 12:44:39,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:15" (3/5) ... 66.56/35.79 [2019-03-28 12:44:39,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4789ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:39, skipping insertion in model container 66.56/35.79 [2019-03-28 12:44:39,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.56/35.79 [2019-03-28 12:44:39,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:15" (4/5) ... 66.56/35.79 [2019-03-28 12:44:39,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4789ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:39, skipping insertion in model container 66.56/35.79 [2019-03-28 12:44:39,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 66.56/35.79 [2019-03-28 12:44:39,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:39" (5/5) ... 66.56/35.79 [2019-03-28 12:44:39,392 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 66.56/35.79 [2019-03-28 12:44:39,412 INFO L133 ementStrategyFactory]: Using default assertion order modulation 66.56/35.79 [2019-03-28 12:44:39,413 INFO L374 BuchiCegarLoop]: Interprodecural is true 66.56/35.79 [2019-03-28 12:44:39,413 INFO L375 BuchiCegarLoop]: Hoare is true 66.56/35.79 [2019-03-28 12:44:39,413 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 66.56/35.79 [2019-03-28 12:44:39,413 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 66.56/35.79 [2019-03-28 12:44:39,413 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 66.56/35.79 [2019-03-28 12:44:39,413 INFO L379 BuchiCegarLoop]: Difference is false 66.56/35.79 [2019-03-28 12:44:39,413 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 66.56/35.79 [2019-03-28 12:44:39,413 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 66.56/35.79 [2019-03-28 12:44:39,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 66.56/35.79 [2019-03-28 12:44:39,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:39,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:39,422 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:39,426 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,426 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,426 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 66.56/35.79 [2019-03-28 12:44:39,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. 66.56/35.79 [2019-03-28 12:44:39,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:39,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:39,428 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:39,428 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,428 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,434 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 5#L27true [79] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 19#L27-2true [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 23#L30-1true [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 31#L35true [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 28#L35-1true [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 29#L13true [155] L13-->L15-4: 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[] 26#L15-4true 66.56/35.79 [2019-03-28 12:44:39,434 INFO L796 eck$LassoCheckResult]: Loop: 26#L15-4true [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 3#L16-1true [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 18#L16-2true [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 8#L18true [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 6#L18-1true [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 32#L15-1true [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 30#L15-2true [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 26#L15-4true 66.56/35.79 [2019-03-28 12:44:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1885123510, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:39,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:39,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1025568906, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:39,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 66.56/35.79 [2019-03-28 12:44:39,635 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 66.56/35.79 [2019-03-28 12:44:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 66.56/35.79 [2019-03-28 12:44:39,678 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. 66.56/35.79 [2019-03-28 12:44:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:39,834 INFO L93 Difference]: Finished difference Result 49 states and 84 transitions. 66.56/35.79 [2019-03-28 12:44:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.79 [2019-03-28 12:44:39,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. 66.56/35.79 [2019-03-28 12:44:39,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:39,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:39,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:39,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.56/35.79 [2019-03-28 12:44:39,843 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 66.56/35.79 [2019-03-28 12:44:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 66.56/35.79 [2019-03-28 12:44:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,846 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,846 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,846 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 66.56/35.79 [2019-03-28 12:44:39,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. 66.56/35.79 [2019-03-28 12:44:39,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:39,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:39,847 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:39,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:39,848 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 93#L27 [79] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 94#L27-2 [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 98#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 99#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 102#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 103#L13 [154] L13-->L15-4: 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[] 101#L15-4 66.56/35.79 [2019-03-28 12:44:39,849 INFO L796 eck$LassoCheckResult]: Loop: 101#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 91#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 92#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 97#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 95#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 96#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 106#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 101#L15-4 66.56/35.79 [2019-03-28 12:44:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1885123511, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:39,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 2 times 66.56/35.79 [2019-03-28 12:44:39,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1526588055, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:39,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:39,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:39,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:40,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:40,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 66.56/35.79 [2019-03-28 12:44:40,170 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 66.56/35.79 [2019-03-28 12:44:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 66.56/35.79 [2019-03-28 12:44:40,203 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 8 states. 66.56/35.79 [2019-03-28 12:44:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:40,438 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. 66.56/35.79 [2019-03-28 12:44:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 66.56/35.79 [2019-03-28 12:44:40,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. 66.56/35.79 [2019-03-28 12:44:40,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:40,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:40,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:40,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.56/35.79 [2019-03-28 12:44:40,442 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 66.56/35.79 [2019-03-28 12:44:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 66.56/35.79 [2019-03-28 12:44:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,444 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,444 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,444 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 66.56/35.79 [2019-03-28 12:44:40,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. 66.56/35.79 [2019-03-28 12:44:40,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:40,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:40,445 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:40,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:40,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:40,446 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 171#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 172#L27-2 [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 176#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 177#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 180#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 181#L13 [154] L13-->L15-4: 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[] 179#L15-4 66.56/35.79 [2019-03-28 12:44:40,447 INFO L796 eck$LassoCheckResult]: Loop: 179#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 169#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 170#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 175#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 173#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 174#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 184#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 179#L15-4 66.56/35.79 [2019-03-28 12:44:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -682699169, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:40,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:40,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 3 times 66.56/35.79 [2019-03-28 12:44:40,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2088563649, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:40,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:40,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:40,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 66.56/35.79 [2019-03-28 12:44:40,774 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 66.56/35.79 [2019-03-28 12:44:40,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 66.56/35.79 [2019-03-28 12:44:40,808 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. 66.56/35.79 [2019-03-28 12:44:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:41,016 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. 66.56/35.79 [2019-03-28 12:44:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 66.56/35.79 [2019-03-28 12:44:41,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. 66.56/35.79 [2019-03-28 12:44:41,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:41,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:41,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:41,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.56/35.79 [2019-03-28 12:44:41,019 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 66.56/35.79 [2019-03-28 12:44:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 66.56/35.79 [2019-03-28 12:44:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,021 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,021 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,021 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 66.56/35.79 [2019-03-28 12:44:41,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. 66.56/35.79 [2019-03-28 12:44:41,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:41,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:41,022 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:41,023 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:41,023 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:41,023 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 251#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 252#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 256#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 257#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 260#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 261#L13 [154] L13-->L15-4: 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[] 259#L15-4 66.56/35.79 [2019-03-28 12:44:41,024 INFO L796 eck$LassoCheckResult]: Loop: 259#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 249#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 250#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 255#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 253#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 254#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 264#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 259#L15-4 66.56/35.79 [2019-03-28 12:44:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -654070018, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:41,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:41,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 4 times 66.56/35.79 [2019-03-28 12:44:41,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:41,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1795160642, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:41,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:41,185 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 66.56/35.79 [2019-03-28 12:44:41,464 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 66.56/35.79 [2019-03-28 12:44:41,570 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 66.56/35.79 [2019-03-28 12:44:41,582 INFO L216 LassoAnalysis]: Preferences: 66.56/35.79 [2019-03-28 12:44:41,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 66.56/35.79 [2019-03-28 12:44:41,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 66.56/35.79 [2019-03-28 12:44:41,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 66.56/35.79 [2019-03-28 12:44:41,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false 66.56/35.79 [2019-03-28 12:44:41,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 66.56/35.79 [2019-03-28 12:44:41,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 66.56/35.79 [2019-03-28 12:44:41,584 INFO L130 ssoRankerPreferences]: Path of dumped script: 66.56/35.79 [2019-03-28 12:44:41,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 66.56/35.79 [2019-03-28 12:44:41,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 66.56/35.79 [2019-03-28 12:44:41,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 66.56/35.79 [2019-03-28 12:44:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,869 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 66.56/35.79 [2019-03-28 12:44:41,990 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 66.56/35.79 [2019-03-28 12:44:41,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:41,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:42,491 INFO L300 LassoAnalysis]: Preprocessing complete. 66.56/35.79 [2019-03-28 12:44:42,496 INFO L497 LassoAnalysis]: Using template 'affine'. 66.56/35.79 [2019-03-28 12:44:42,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.56/35.79 [2019-03-28 12:44:42,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.56/35.79 [2019-03-28 12:44:42,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.56/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.56/35.79 Number of strict supporting invariants: 0 66.56/35.79 Number of non-strict supporting invariants: 1 66.56/35.79 Consider only non-deceasing supporting invariants: true 66.56/35.79 Simplify termination arguments: true 66.56/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.56/35.79 [2019-03-28 12:44:42,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.56/35.79 [2019-03-28 12:44:42,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.56/35.79 [2019-03-28 12:44:42,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.56/35.79 [2019-03-28 12:44:42,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.56/35.79 [2019-03-28 12:44:42,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.56/35.79 [2019-03-28 12:44:42,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.56/35.79 [2019-03-28 12:44:42,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 66.56/35.79 [2019-03-28 12:44:42,619 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 66.56/35.79 [2019-03-28 12:44:42,619 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. 66.56/35.79 [2019-03-28 12:44:42,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 66.56/35.79 [2019-03-28 12:44:42,623 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 66.56/35.79 [2019-03-28 12:44:42,623 INFO L518 LassoAnalysis]: Proved termination. 66.56/35.79 [2019-03-28 12:44:42,624 INFO L520 LassoAnalysis]: Termination argument consisting of: 66.56/35.79 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset 66.56/35.79 Supporting invariants [] 66.56/35.79 [2019-03-28 12:44:42,675 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed 66.56/35.79 [2019-03-28 12:44:42,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.56/35.79 [2019-03-28 12:44:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:42,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:42,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:42,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:43,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:43,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:43,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:43,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:43,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:43,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:43,412 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 15 predicates after loop cannibalization 66.56/35.79 [2019-03-28 12:44:43,416 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 15 loop predicates 66.56/35.79 [2019-03-28 12:44:43,417 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 8 Second operand 7 states. 66.56/35.79 [2019-03-28 12:44:44,027 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 39 states and 50 transitions. Complement of second has 17 states. 66.56/35.79 [2019-03-28 12:44:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 4 non-accepting loop states 2 accepting loop states 66.56/35.79 [2019-03-28 12:44:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 66.56/35.79 [2019-03-28 12:44:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. 66.56/35.79 [2019-03-28 12:44:44,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 7 letters. Loop has 7 letters. 66.56/35.79 [2019-03-28 12:44:44,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.56/35.79 [2019-03-28 12:44:44,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 14 letters. Loop has 7 letters. 66.56/35.79 [2019-03-28 12:44:44,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.56/35.79 [2019-03-28 12:44:44,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 7 letters. Loop has 14 letters. 66.56/35.79 [2019-03-28 12:44:44,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.56/35.79 [2019-03-28 12:44:44,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. 66.56/35.79 [2019-03-28 12:44:44,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:44,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:44,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:44,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.56/35.79 [2019-03-28 12:44:44,041 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 66.56/35.79 [2019-03-28 12:44:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 66.56/35.79 [2019-03-28 12:44:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,043 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,043 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,043 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 66.56/35.79 [2019-03-28 12:44:44,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. 66.56/35.79 [2019-03-28 12:44:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:44,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:44,044 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:44,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:44,044 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:44,045 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 552#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 553#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 557#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 558#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 561#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 562#L13 [155] L13-->L15-4: 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[] 563#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 570#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 569#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 568#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 567#L18-1 [175] L18-1-->L15-1: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 566#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 564#L15-2 [181] L15-2-->L15-4: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 560#L15-4 66.56/35.79 [2019-03-28 12:44:44,046 INFO L796 eck$LassoCheckResult]: Loop: 560#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 550#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 551#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 556#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 554#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 555#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 565#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 560#L15-4 66.56/35.79 [2019-03-28 12:44:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash -756995357, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:44,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 5 times 66.56/35.79 [2019-03-28 12:44:44,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 729760445, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:44,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:44,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 66.56/35.79 [2019-03-28 12:44:44,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 66.56/35.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 66.56/35.79 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 66.56/35.79 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 66.56/35.79 [2019-03-28 12:44:44,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.56/35.79 [2019-03-28 12:44:44,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core 66.56/35.79 [2019-03-28 12:44:44,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.56/35.79 [2019-03-28 12:44:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.56/35.79 [2019-03-28 12:44:44,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 66.56/35.79 [2019-03-28 12:44:44,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 66.56/35.79 [2019-03-28 12:44:44,333 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 66.56/35.79 [2019-03-28 12:44:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 66.56/35.79 [2019-03-28 12:44:44,367 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. 66.56/35.79 [2019-03-28 12:44:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 66.56/35.79 [2019-03-28 12:44:44,414 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 66.56/35.79 [2019-03-28 12:44:44,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:44,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:44,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 66.56/35.79 [2019-03-28 12:44:44,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.56/35.79 [2019-03-28 12:44:44,420 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. 66.56/35.79 [2019-03-28 12:44:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. 66.56/35.79 [2019-03-28 12:44:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 66.56/35.79 [2019-03-28 12:44:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. 66.56/35.79 [2019-03-28 12:44:44,421 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 66.56/35.79 [2019-03-28 12:44:44,421 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 66.56/35.79 [2019-03-28 12:44:44,422 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 66.56/35.79 [2019-03-28 12:44:44,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. 66.56/35.79 [2019-03-28 12:44:44,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 66.56/35.79 [2019-03-28 12:44:44,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 66.56/35.79 [2019-03-28 12:44:44,422 INFO L119 BuchiIsEmpty]: Starting construction of run 66.56/35.79 [2019-03-28 12:44:44,423 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:44,423 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 66.56/35.79 [2019-03-28 12:44:44,423 INFO L794 eck$LassoCheckResult]: Stem: 673#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 666#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 667#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 671#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 672#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 675#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, 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_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 676#L13 [155] L13-->L15-4: 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[] 674#L15-4 66.56/35.79 [2019-03-28 12:44:44,424 INFO L796 eck$LassoCheckResult]: Loop: 674#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 664#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 665#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 670#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 668#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 669#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 677#L15-2 [181] L15-2-->L15-4: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 674#L15-4 66.56/35.79 [2019-03-28 12:44:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash -654070017, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:44,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 660213728, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:44,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.56/35.79 [2019-03-28 12:44:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash -756996318, now seen corresponding path program 1 times 66.56/35.79 [2019-03-28 12:44:44,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 66.56/35.79 [2019-03-28 12:44:44,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 66.56/35.79 [2019-03-28 12:44:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 66.56/35.79 [2019-03-28 12:44:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 66.56/35.79 [2019-03-28 12:44:44,600 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 66.56/35.79 [2019-03-28 12:44:44,965 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 66.56/35.79 [2019-03-28 12:44:45,105 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 66.56/35.79 [2019-03-28 12:44:45,107 INFO L216 LassoAnalysis]: Preferences: 66.56/35.79 [2019-03-28 12:44:45,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 66.56/35.79 [2019-03-28 12:44:45,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 66.56/35.79 [2019-03-28 12:44:45,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 66.56/35.79 [2019-03-28 12:44:45,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false 66.56/35.79 [2019-03-28 12:44:45,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 66.56/35.79 [2019-03-28 12:44:45,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 66.56/35.79 [2019-03-28 12:44:45,108 INFO L130 ssoRankerPreferences]: Path of dumped script: 66.56/35.79 [2019-03-28 12:44:45,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 66.56/35.79 [2019-03-28 12:44:45,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 66.56/35.79 [2019-03-28 12:44:45,108 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 66.56/35.79 [2019-03-28 12:44:45,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,379 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 66.56/35.79 [2019-03-28 12:44:45,506 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 66.56/35.79 [2019-03-28 12:44:45,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 66.56/35.79 [2019-03-28 12:44:45,966 INFO L300 LassoAnalysis]: Preprocessing complete. 66.56/35.79 [2019-03-28 12:44:45,966 INFO L497 LassoAnalysis]: Using template 'affine'. 66.56/35.79 [2019-03-28 12:44:45,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.58/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.58/35.79 Number of strict supporting invariants: 0 66.58/35.79 Number of non-strict supporting invariants: 1 66.58/35.79 Consider only non-deceasing supporting invariants: true 66.58/35.79 Simplify termination arguments: true 66.58/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.58/35.79 [2019-03-28 12:44:45,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.58/35.79 [2019-03-28 12:44:45,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.58/35.79 [2019-03-28 12:44:45,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.58/35.79 [2019-03-28 12:44:45,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.58/35.79 [2019-03-28 12:44:45,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.58/35.79 [2019-03-28 12:44:45,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.58/35.79 [2019-03-28 12:44:45,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.58/35.79 [2019-03-28 12:44:45,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.58/35.79 [2019-03-28 12:44:45,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.58/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.58/35.79 Number of strict supporting invariants: 0 66.58/35.79 Number of non-strict supporting invariants: 1 66.58/35.79 Consider only non-deceasing supporting invariants: true 66.58/35.79 Simplify termination arguments: true 66.58/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.58/35.79 [2019-03-28 12:44:45,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.58/35.79 [2019-03-28 12:44:45,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.58/35.79 [2019-03-28 12:44:45,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.58/35.79 [2019-03-28 12:44:45,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.58/35.79 [2019-03-28 12:44:45,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.58/35.79 [2019-03-28 12:44:45,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.58/35.79 [2019-03-28 12:44:45,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.58/35.79 [2019-03-28 12:44:45,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.58/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.58/35.79 Number of strict supporting invariants: 0 66.58/35.79 Number of non-strict supporting invariants: 1 66.58/35.79 Consider only non-deceasing supporting invariants: true 66.58/35.79 Simplify termination arguments: true 66.58/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.58/35.79 [2019-03-28 12:44:45,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.58/35.79 [2019-03-28 12:44:45,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 66.58/35.79 [2019-03-28 12:44:45,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.58/35.79 [2019-03-28 12:44:45,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.58/35.79 [2019-03-28 12:44:45,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.58/35.79 [2019-03-28 12:44:45,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 66.58/35.79 [2019-03-28 12:44:45,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 66.58/35.79 [2019-03-28 12:44:45,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.58/35.79 [2019-03-28 12:44:45,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.58/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.58/35.79 Number of strict supporting invariants: 0 66.58/35.79 Number of non-strict supporting invariants: 1 66.58/35.79 Consider only non-deceasing supporting invariants: true 66.58/35.79 Simplify termination arguments: true 66.58/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.58/35.79 [2019-03-28 12:44:45,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.58/35.79 [2019-03-28 12:44:45,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.58/35.79 [2019-03-28 12:44:45,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.58/35.79 [2019-03-28 12:44:45,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.58/35.79 [2019-03-28 12:44:45,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.58/35.79 [2019-03-28 12:44:45,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.58/35.79 [2019-03-28 12:44:45,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 66.58/35.79 [2019-03-28 12:44:45,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 66.58/35.79 Termination analysis: LINEAR_WITH_GUESSES 66.58/35.79 Number of strict supporting invariants: 0 66.58/35.79 Number of non-strict supporting invariants: 1 66.58/35.79 Consider only non-deceasing supporting invariants: true 66.58/35.79 Simplify termination arguments: true 66.58/35.79 Simplify supporting invariants: trueOverapproximate stem: false 66.58/35.79 [2019-03-28 12:44:45,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. 66.58/35.79 [2019-03-28 12:44:45,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 66.58/35.79 [2019-03-28 12:44:45,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 66.58/35.79 [2019-03-28 12:44:45,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 66.58/35.79 [2019-03-28 12:44:45,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 66.58/35.79 [2019-03-28 12:44:45,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 66.58/35.79 [2019-03-28 12:44:46,006 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 66.58/35.79 [2019-03-28 12:44:46,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 66.58/35.79 [2019-03-28 12:44:46,023 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. 66.58/35.79 [2019-03-28 12:44:46,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 66.58/35.79 [2019-03-28 12:44:46,024 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 66.58/35.79 [2019-03-28 12:44:46,025 INFO L518 LassoAnalysis]: Proved termination. 66.58/35.79 [2019-03-28 12:44:46,025 INFO L520 LassoAnalysis]: Termination argument consisting of: 66.58/35.79 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2 - 1*ULTIMATE.start_cstrncmp_~s2.offset 66.58/35.79 Supporting invariants [] 66.58/35.79 [2019-03-28 12:44:46,074 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed 66.58/35.79 [2019-03-28 12:44:46,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.79 [2019-03-28 12:44:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 66.58/35.79 [2019-03-28 12:44:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.58/35.79 [2019-03-28 12:44:46,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 66.58/35.79 [2019-03-28 12:44:46,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.58/35.79 [2019-03-28 12:44:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.58/35.79 [2019-03-28 12:44:46,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core 66.58/35.79 [2019-03-28 12:44:46,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.58/35.79 [2019-03-28 12:44:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 66.58/35.79 [2019-03-28 12:44:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.58/35.79 [2019-03-28 12:44:46,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core 66.58/35.79 [2019-03-28 12:44:46,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.58/35.79 [2019-03-28 12:44:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 66.58/35.79 [2019-03-28 12:44:46,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core 66.58/35.79 [2019-03-28 12:44:46,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... 66.58/35.79 [2019-03-28 12:44:46,320 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 66.58/35.79 [2019-03-28 12:44:46,320 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 66.58/35.79 [2019-03-28 12:44:46,320 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. 66.58/35.79 [2019-03-28 12:44:46,513 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 22 states and 27 transitions. Complement of second has 9 states. 66.58/35.79 [2019-03-28 12:44:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states 66.58/35.79 [2019-03-28 12:44:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 66.58/35.79 [2019-03-28 12:44:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. 66.58/35.79 [2019-03-28 12:44:46,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 7 letters. Loop has 7 letters. 66.58/35.79 [2019-03-28 12:44:46,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.58/35.79 [2019-03-28 12:44:46,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 14 letters. Loop has 7 letters. 66.58/35.79 [2019-03-28 12:44:46,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.58/35.79 [2019-03-28 12:44:46,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 7 letters. Loop has 14 letters. 66.58/35.79 [2019-03-28 12:44:46,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. 66.58/35.79 [2019-03-28 12:44:46,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. 66.58/35.79 [2019-03-28 12:44:46,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 66.58/35.79 [2019-03-28 12:44:46,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 66.58/35.79 [2019-03-28 12:44:46,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 66.58/35.79 [2019-03-28 12:44:46,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 66.58/35.79 [2019-03-28 12:44:46,520 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,520 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,520 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,520 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 66.58/35.79 [2019-03-28 12:44:46,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 66.58/35.79 [2019-03-28 12:44:46,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 66.58/35.79 [2019-03-28 12:44:46,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 66.58/35.79 [2019-03-28 12:44:46,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:46 BasicIcfg 66.58/35.79 [2019-03-28 12:44:46,526 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 66.58/35.79 [2019-03-28 12:44:46,527 INFO L168 Benchmark]: Toolchain (without parser) took 31440.93 ms. Allocated memory was 649.6 MB in the beginning and 966.8 MB in the end (delta: 317.2 MB). Free memory was 564.9 MB in the beginning and 866.0 MB in the end (delta: -301.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,527 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. 66.58/35.79 [2019-03-28 12:44:46,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.22 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 564.9 MB in the beginning and 640.8 MB in the end (delta: -75.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.30 ms. Allocated memory is still 673.2 MB. Free memory was 640.8 MB in the beginning and 636.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,529 INFO L168 Benchmark]: Boogie Preprocessor took 27.16 ms. Allocated memory is still 673.2 MB. Free memory was 636.9 MB in the beginning and 634.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,529 INFO L168 Benchmark]: RCFGBuilder took 337.14 ms. Allocated memory is still 673.2 MB. Free memory was 634.7 MB in the beginning and 610.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,529 INFO L168 Benchmark]: BlockEncodingV2 took 136.98 ms. Allocated memory is still 673.2 MB. Free memory was 610.4 MB in the beginning and 599.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,530 INFO L168 Benchmark]: TraceAbstraction took 23432.14 ms. Allocated memory was 673.2 MB in the beginning and 912.8 MB in the end (delta: 239.6 MB). Free memory was 599.6 MB in the beginning and 583.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 255.5 MB. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,530 INFO L168 Benchmark]: BuchiAutomizer took 7142.35 ms. Allocated memory was 912.8 MB in the beginning and 966.8 MB in the end (delta: 54.0 MB). Free memory was 583.8 MB in the beginning and 866.0 MB in the end (delta: -282.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 66.58/35.79 [2019-03-28 12:44:46,534 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 66.58/35.79 --- Results --- 66.58/35.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 66.58/35.79 - StatisticsResult: Initial Icfg 66.58/35.79 40 locations, 46 edges 66.58/35.79 - StatisticsResult: Encoded RCFG 66.58/35.79 30 locations, 53 edges 66.58/35.79 * Results from de.uni_freiburg.informatik.ultimate.core: 66.58/35.79 - StatisticsResult: Toolchain Benchmarks 66.58/35.79 Benchmark results are: 66.58/35.79 * 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. 66.58/35.79 * CACSL2BoogieTranslator took 316.22 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 564.9 MB in the beginning and 640.8 MB in the end (delta: -75.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 66.58/35.79 * Boogie Procedure Inliner took 43.30 ms. Allocated memory is still 673.2 MB. Free memory was 640.8 MB in the beginning and 636.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 66.58/35.79 * Boogie Preprocessor took 27.16 ms. Allocated memory is still 673.2 MB. Free memory was 636.9 MB in the beginning and 634.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 66.58/35.79 * RCFGBuilder took 337.14 ms. Allocated memory is still 673.2 MB. Free memory was 634.7 MB in the beginning and 610.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. 66.58/35.79 * BlockEncodingV2 took 136.98 ms. Allocated memory is still 673.2 MB. Free memory was 610.4 MB in the beginning and 599.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 66.58/35.79 * TraceAbstraction took 23432.14 ms. Allocated memory was 673.2 MB in the beginning and 912.8 MB in the end (delta: 239.6 MB). Free memory was 599.6 MB in the beginning and 583.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 255.5 MB. Max. memory is 50.3 GB. 66.58/35.79 * BuchiAutomizer took 7142.35 ms. Allocated memory was 912.8 MB in the beginning and 966.8 MB in the end (delta: 54.0 MB). Free memory was 583.8 MB in the beginning and 866.0 MB in the end (delta: -282.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 66.58/35.79 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.79 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #memory_int 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 - GenericResult: Unfinished Backtranslation 66.58/35.80 unknown boogie variable #length 66.58/35.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 66.58/35.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 35]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 35]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 36]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 36]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 66.58/35.80 For all program executions holds that pointer dereference always succeeds at this location 66.58/35.80 - AllSpecificationsHoldResult: All specifications hold 66.58/35.80 14 specifications checked. All of them hold 66.58/35.80 - InvariantResult [Line: 15]: Loop Invariant 66.58/35.80 [2019-03-28 12:44:46,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,559 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] 66.58/35.80 [2019-03-28 12:44:46,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,571 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 [2019-03-28 12:44:46,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 66.58/35.80 [2019-03-28 12:44:46,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 66.58/35.80 Derived loop invariant: ((((((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && 1 == \valid[s1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) && 0 == s2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: !(ULTIMATE.start_main_~nondetString2~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 0 == s1) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) || ((((((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && 1 <= s2) && nondetString1 == 0) && 1 <= s1) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: !(ULTIMATE.start_main_~nondetString2~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && s1 + 1 <= unknown-#length-unknown[s1]) && \valid[s1] == 1) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) 66.58/35.80 - StatisticsResult: Ultimate Automizer benchmark data 66.58/35.80 CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 23.3s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 1565 SDslu, 1124 SDs, 0 SdLazy, 2629 SolverSat, 377 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=25, 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, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 327 HoareAnnotationTreeSize, 1 FomulaSimplifications, 833 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 408 ConstructedInterpolants, 38 QuantifiedInterpolants, 81136 SizeOfPredicates, 82 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 32/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 66.58/35.80 - StatisticsResult: Constructed decomposition of program 66.58/35.80 Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s1 and consists of 11 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s2 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. 66.58/35.80 - StatisticsResult: Timing statistics 66.58/35.80 BüchiAutomizer plugin needed 7.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.5s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 233 SDslu, 483 SDs, 0 SdLazy, 775 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf100 lsp89 ukn86 mio100 lsp45 div100 bol100 ite100 ukn100 eq192 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 66.58/35.80 - TerminationAnalysisResult: Termination proven 66.58/35.80 Buchi Automizer proved that your program is terminating 66.58/35.80 RESULT: Ultimate proved your program to be correct! 66.58/35.80 !SESSION 2019-03-28 12:44:11.750 ----------------------------------------------- 66.58/35.80 eclipse.buildId=unknown 66.58/35.80 java.version=1.8.0_181 66.58/35.80 java.vendor=Oracle Corporation 66.58/35.80 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 66.58/35.80 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 66.58/35.80 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 66.58/35.80 66.58/35.80 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:46.803 66.58/35.80 !MESSAGE The workspace will exit with unsaved changes in this session. 66.58/35.80 Received shutdown request... 66.58/35.80 Ultimate: 66.58/35.80 GTK+ Version Check 66.58/35.80 EOF