148.10/100.77 YES 148.10/100.77 148.10/100.77 Ultimate: Cannot open display: 148.10/100.77 This is Ultimate 0.1.24-8dc7c08-m 148.10/100.77 [2019-03-28 12:40:16,215 INFO L170 SettingsManager]: Resetting all preferences to default values... 148.10/100.77 [2019-03-28 12:40:16,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 148.10/100.77 [2019-03-28 12:40:16,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 148.10/100.77 [2019-03-28 12:40:16,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 148.10/100.77 [2019-03-28 12:40:16,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 148.10/100.77 [2019-03-28 12:40:16,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 148.10/100.77 [2019-03-28 12:40:16,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 148.10/100.77 [2019-03-28 12:40:16,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 148.10/100.77 [2019-03-28 12:40:16,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 148.10/100.77 [2019-03-28 12:40:16,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 148.10/100.77 [2019-03-28 12:40:16,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 148.10/100.77 [2019-03-28 12:40:16,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 148.10/100.77 [2019-03-28 12:40:16,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 148.10/100.77 [2019-03-28 12:40:16,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 148.10/100.77 [2019-03-28 12:40:16,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 148.10/100.77 [2019-03-28 12:40:16,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 148.10/100.77 [2019-03-28 12:40:16,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 148.10/100.77 [2019-03-28 12:40:16,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 148.10/100.77 [2019-03-28 12:40:16,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 148.10/100.77 [2019-03-28 12:40:16,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 148.10/100.77 [2019-03-28 12:40:16,251 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 148.10/100.77 [2019-03-28 12:40:16,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 148.10/100.77 [2019-03-28 12:40:16,252 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 148.10/100.77 [2019-03-28 12:40:16,253 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 148.10/100.77 [2019-03-28 12:40:16,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 148.10/100.77 [2019-03-28 12:40:16,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 148.10/100.77 [2019-03-28 12:40:16,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 148.10/100.77 [2019-03-28 12:40:16,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 148.10/100.77 [2019-03-28 12:40:16,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 148.10/100.77 [2019-03-28 12:40:16,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 148.10/100.77 [2019-03-28 12:40:16,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 148.10/100.77 [2019-03-28 12:40:16,258 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 148.10/100.77 [2019-03-28 12:40:16,273 INFO L110 SettingsManager]: Loading preferences was successful 148.10/100.77 [2019-03-28 12:40:16,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 148.10/100.77 [2019-03-28 12:40:16,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 148.10/100.77 [2019-03-28 12:40:16,274 INFO L133 SettingsManager]: * Rewrite not-equals=true 148.10/100.77 [2019-03-28 12:40:16,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 148.10/100.77 [2019-03-28 12:40:16,275 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 148.10/100.77 [2019-03-28 12:40:16,275 INFO L133 SettingsManager]: * Use SBE=true 148.10/100.77 [2019-03-28 12:40:16,275 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 148.10/100.77 [2019-03-28 12:40:16,275 INFO L133 SettingsManager]: * Use old map elimination=false 148.10/100.77 [2019-03-28 12:40:16,275 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 148.10/100.77 [2019-03-28 12:40:16,275 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 148.10/100.77 [2019-03-28 12:40:16,276 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 148.10/100.77 [2019-03-28 12:40:16,276 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 148.10/100.77 [2019-03-28 12:40:16,276 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 148.10/100.77 [2019-03-28 12:40:16,276 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 148.10/100.77 [2019-03-28 12:40:16,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 148.10/100.77 [2019-03-28 12:40:16,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 148.10/100.77 [2019-03-28 12:40:16,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE 148.10/100.77 [2019-03-28 12:40:16,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 148.10/100.77 [2019-03-28 12:40:16,277 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 148.10/100.77 [2019-03-28 12:40:16,277 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 148.10/100.77 [2019-03-28 12:40:16,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 148.10/100.77 [2019-03-28 12:40:16,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 148.10/100.77 [2019-03-28 12:40:16,278 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 148.10/100.77 [2019-03-28 12:40:16,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 148.10/100.77 [2019-03-28 12:40:16,278 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 148.10/100.77 [2019-03-28 12:40:16,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 148.10/100.77 [2019-03-28 12:40:16,278 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 148.10/100.77 [2019-03-28 12:40:16,278 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 148.10/100.77 [2019-03-28 12:40:16,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 148.10/100.77 [2019-03-28 12:40:16,317 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 148.10/100.77 [2019-03-28 12:40:16,320 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 148.10/100.77 [2019-03-28 12:40:16,322 INFO L271 PluginConnector]: Initializing CDTParser... 148.10/100.77 [2019-03-28 12:40:16,322 INFO L276 PluginConnector]: CDTParser initialized 148.10/100.77 [2019-03-28 12:40:16,323 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 148.10/100.77 [2019-03-28 12:40:16,406 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/368f50a4ee2748f989c0b1fe6591c287/FLAG0887f4505 148.10/100.77 [2019-03-28 12:40:16,760 INFO L307 CDTParser]: Found 1 translation units. 148.10/100.77 [2019-03-28 12:40:16,761 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 148.10/100.77 [2019-03-28 12:40:16,761 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 148.10/100.77 [2019-03-28 12:40:16,768 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/368f50a4ee2748f989c0b1fe6591c287/FLAG0887f4505 148.10/100.77 [2019-03-28 12:40:17,164 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/368f50a4ee2748f989c0b1fe6591c287 148.10/100.77 [2019-03-28 12:40:17,176 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 148.10/100.77 [2019-03-28 12:40:17,178 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 148.10/100.77 [2019-03-28 12:40:17,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 148.10/100.77 [2019-03-28 12:40:17,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 148.10/100.77 [2019-03-28 12:40:17,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 148.10/100.77 [2019-03-28 12:40:17,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3001d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17, skipping insertion in model container 148.10/100.77 [2019-03-28 12:40:17,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 148.10/100.77 [2019-03-28 12:40:17,214 INFO L176 MainTranslator]: Built tables and reachable declarations 148.10/100.77 [2019-03-28 12:40:17,388 INFO L206 PostProcessor]: Analyzing one entry point: main 148.10/100.77 [2019-03-28 12:40:17,400 INFO L191 MainTranslator]: Completed pre-run 148.10/100.77 [2019-03-28 12:40:17,482 INFO L206 PostProcessor]: Analyzing one entry point: main 148.10/100.77 [2019-03-28 12:40:17,499 INFO L195 MainTranslator]: Completed translation 148.10/100.77 [2019-03-28 12:40:17,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17 WrapperNode 148.10/100.77 [2019-03-28 12:40:17,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 148.10/100.77 [2019-03-28 12:40:17,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 148.10/100.77 [2019-03-28 12:40:17,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 148.10/100.77 [2019-03-28 12:40:17,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 148.10/100.77 [2019-03-28 12:40:17,510 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:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,519 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:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 148.10/100.77 [2019-03-28 12:40:17,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 148.10/100.77 [2019-03-28 12:40:17,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 148.10/100.77 [2019-03-28 12:40:17,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized 148.10/100.77 [2019-03-28 12:40:17,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 148.10/100.77 [2019-03-28 12:40:17,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 148.10/100.77 [2019-03-28 12:40:17,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... 148.10/100.77 [2019-03-28 12:40:17,578 INFO L276 PluginConnector]: RCFGBuilder initialized 148.10/100.77 [2019-03-28 12:40:17,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (1/1) ... 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 148.10/100.77 [2019-03-28 12:40:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 148.10/100.77 [2019-03-28 12:40:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 148.10/100.77 [2019-03-28 12:40:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 148.10/100.77 [2019-03-28 12:40:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 148.10/100.77 [2019-03-28 12:40:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 148.10/100.77 [2019-03-28 12:40:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 148.10/100.77 [2019-03-28 12:40:17,930 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 148.10/100.77 [2019-03-28 12:40:17,931 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 148.10/100.77 [2019-03-28 12:40:17,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:17 BoogieIcfgContainer 148.10/100.77 [2019-03-28 12:40:17,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 148.10/100.77 [2019-03-28 12:40:17,933 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 148.10/100.77 [2019-03-28 12:40:17,933 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 148.10/100.77 [2019-03-28 12:40:17,936 INFO L276 PluginConnector]: BlockEncodingV2 initialized 148.10/100.77 [2019-03-28 12:40:17,937 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:17" (1/1) ... 148.10/100.77 [2019-03-28 12:40:17,958 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 50 edges 148.10/100.77 [2019-03-28 12:40:17,960 INFO L258 BlockEncoder]: Using Remove infeasible edges 148.10/100.77 [2019-03-28 12:40:17,961 INFO L263 BlockEncoder]: Using Maximize final states 148.10/100.77 [2019-03-28 12:40:17,961 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 148.10/100.77 [2019-03-28 12:40:17,962 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 148.10/100.77 [2019-03-28 12:40:17,963 INFO L296 BlockEncoder]: Using Remove sink states 148.10/100.77 [2019-03-28 12:40:17,964 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 148.10/100.77 [2019-03-28 12:40:17,964 INFO L179 BlockEncoder]: Using Rewrite not-equals 148.10/100.77 [2019-03-28 12:40:17,995 INFO L185 BlockEncoder]: Using Use SBE 148.10/100.77 [2019-03-28 12:40:18,036 INFO L200 BlockEncoder]: SBE split 23 edges 148.10/100.77 [2019-03-28 12:40:18,041 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 148.10/100.77 [2019-03-28 12:40:18,043 INFO L71 MaximizeFinalStates]: 0 new accepting states 148.10/100.77 [2019-03-28 12:40:18,084 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 148.10/100.77 [2019-03-28 12:40:18,087 INFO L70 RemoveSinkStates]: Removed 25 edges and 2 locations by removing sink states 148.10/100.77 [2019-03-28 12:40:18,088 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 148.10/100.77 [2019-03-28 12:40:18,089 INFO L71 MaximizeFinalStates]: 0 new accepting states 148.10/100.77 [2019-03-28 12:40:18,089 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 148.10/100.77 [2019-03-28 12:40:18,089 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 148.10/100.77 [2019-03-28 12:40:18,090 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 72 edges 148.10/100.77 [2019-03-28 12:40:18,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:18 BasicIcfg 148.10/100.77 [2019-03-28 12:40:18,091 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 148.10/100.77 [2019-03-28 12:40:18,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 148.10/100.77 [2019-03-28 12:40:18,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... 148.10/100.77 [2019-03-28 12:40:18,095 INFO L276 PluginConnector]: TraceAbstraction initialized 148.10/100.77 [2019-03-28 12:40:18,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:17" (1/4) ... 148.10/100.77 [2019-03-28 12:40:18,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd4eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:18, skipping insertion in model container 148.10/100.77 [2019-03-28 12:40:18,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (2/4) ... 148.10/100.77 [2019-03-28 12:40:18,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd4eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:18, skipping insertion in model container 148.10/100.77 [2019-03-28 12:40:18,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:17" (3/4) ... 148.10/100.77 [2019-03-28 12:40:18,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd4eb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:18, skipping insertion in model container 148.10/100.77 [2019-03-28 12:40:18,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:18" (4/4) ... 148.10/100.77 [2019-03-28 12:40:18,099 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 148.10/100.77 [2019-03-28 12:40:18,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 148.10/100.77 [2019-03-28 12:40:18,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. 148.10/100.77 [2019-03-28 12:40:18,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. 148.10/100.77 [2019-03-28 12:40:18,163 INFO L133 ementStrategyFactory]: Using default assertion order modulation 148.10/100.77 [2019-03-28 12:40:18,164 INFO L382 AbstractCegarLoop]: Interprodecural is true 148.10/100.77 [2019-03-28 12:40:18,164 INFO L383 AbstractCegarLoop]: Hoare is true 148.10/100.77 [2019-03-28 12:40:18,165 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 148.10/100.77 [2019-03-28 12:40:18,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 148.10/100.77 [2019-03-28 12:40:18,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 148.10/100.77 [2019-03-28 12:40:18,165 INFO L387 AbstractCegarLoop]: Difference is false 148.10/100.77 [2019-03-28 12:40:18,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 148.10/100.77 [2019-03-28 12:40:18,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 148.10/100.77 [2019-03-28 12:40:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. 148.10/100.77 [2019-03-28 12:40:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 148.10/100.77 [2019-03-28 12:40:18,186 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:18,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:18,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash 253520800, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:18,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:18,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:18,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:18,405 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:18,590 INFO L93 Difference]: Finished difference Result 60 states and 125 transitions. 148.10/100.77 [2019-03-28 12:40:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:18,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:18,607 INFO L225 Difference]: With dead ends: 60 148.10/100.77 [2019-03-28 12:40:18,607 INFO L226 Difference]: Without dead ends: 34 148.10/100.77 [2019-03-28 12:40:18,612 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 148.10/100.77 [2019-03-28 12:40:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 148.10/100.77 [2019-03-28 12:40:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 148.10/100.77 [2019-03-28 12:40:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 148.10/100.77 [2019-03-28 12:40:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:18,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 68 transitions. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:18,653 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:18,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 148.10/100.77 [2019-03-28 12:40:18,654 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:18,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:18,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash 253520802, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:18,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:18,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:18,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:18,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:18,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:18,696 INFO L87 Difference]: Start difference. First operand 34 states and 68 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:18,815 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:18,840 INFO L225 Difference]: With dead ends: 35 148.10/100.77 [2019-03-28 12:40:18,840 INFO L226 Difference]: Without dead ends: 34 148.10/100.77 [2019-03-28 12:40:18,842 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 148.10/100.77 [2019-03-28 12:40:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 148.10/100.77 [2019-03-28 12:40:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 148.10/100.77 [2019-03-28 12:40:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 148.10/100.77 [2019-03-28 12:40:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:18,847 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 67 transitions. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:18,848 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:18,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 148.10/100.77 [2019-03-28 12:40:18,848 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:18,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:18,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:18,849 INFO L82 PathProgramCache]: Analyzing trace with hash 253520803, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:18,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:18,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:18,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:18,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:18,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 148.10/100.77 [2019-03-28 12:40:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 148.10/100.77 [2019-03-28 12:40:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 148.10/100.77 [2019-03-28 12:40:18,882 INFO L87 Difference]: Start difference. First operand 34 states and 67 transitions. Second operand 4 states. 148.10/100.77 [2019-03-28 12:40:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:18,970 INFO L93 Difference]: Finished difference Result 34 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:18,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:18,971 INFO L225 Difference]: With dead ends: 34 148.10/100.77 [2019-03-28 12:40:18,971 INFO L226 Difference]: Without dead ends: 33 148.10/100.77 [2019-03-28 12:40:18,972 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 148.10/100.77 [2019-03-28 12:40:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 148.10/100.77 [2019-03-28 12:40:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 148.10/100.77 [2019-03-28 12:40:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 148.10/100.77 [2019-03-28 12:40:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 66 transitions. 148.10/100.77 [2019-03-28 12:40:18,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 66 transitions. Word has length 5 148.10/100.77 [2019-03-28 12:40:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:18,978 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 66 transitions. 148.10/100.77 [2019-03-28 12:40:18,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 66 transitions. 148.10/100.77 [2019-03-28 12:40:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 148.10/100.77 [2019-03-28 12:40:18,979 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:18,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:18,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash -730791235, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:18,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:18,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:19,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:19,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:19,012 INFO L87 Difference]: Start difference. First operand 33 states and 66 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,118 INFO L93 Difference]: Finished difference Result 33 states and 66 transitions. 148.10/100.77 [2019-03-28 12:40:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,120 INFO L225 Difference]: With dead ends: 33 148.10/100.77 [2019-03-28 12:40:19,120 INFO L226 Difference]: Without dead ends: 32 148.10/100.77 [2019-03-28 12:40:19,121 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 148.10/100.77 [2019-03-28 12:40:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 148.10/100.77 [2019-03-28 12:40:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. 148.10/100.77 [2019-03-28 12:40:19,126 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 64 transitions. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,126 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 64 transitions. 148.10/100.77 [2019-03-28 12:40:19,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 64 transitions. 148.10/100.77 [2019-03-28 12:40:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 148.10/100.77 [2019-03-28 12:40:19,127 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,127 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash -730791233, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:19,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:19,165 INFO L87 Difference]: Start difference. First operand 32 states and 64 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,264 INFO L93 Difference]: Finished difference Result 33 states and 64 transitions. 148.10/100.77 [2019-03-28 12:40:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,266 INFO L225 Difference]: With dead ends: 33 148.10/100.77 [2019-03-28 12:40:19,266 INFO L226 Difference]: Without dead ends: 32 148.10/100.77 [2019-03-28 12:40:19,266 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 148.10/100.77 [2019-03-28 12:40:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 148.10/100.77 [2019-03-28 12:40:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 63 transitions. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,271 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 148.10/100.77 [2019-03-28 12:40:19,272 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,273 INFO L82 PathProgramCache]: Analyzing trace with hash -730791232, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:19,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 148.10/100.77 [2019-03-28 12:40:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 148.10/100.77 [2019-03-28 12:40:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 148.10/100.77 [2019-03-28 12:40:19,307 INFO L87 Difference]: Start difference. First operand 32 states and 63 transitions. Second operand 4 states. 148.10/100.77 [2019-03-28 12:40:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,404 INFO L93 Difference]: Finished difference Result 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:19,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,405 INFO L225 Difference]: With dead ends: 32 148.10/100.77 [2019-03-28 12:40:19,405 INFO L226 Difference]: Without dead ends: 31 148.10/100.77 [2019-03-28 12:40:19,406 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 148.10/100.77 [2019-03-28 12:40:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 148.10/100.77 [2019-03-28 12:40:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 148.10/100.77 [2019-03-28 12:40:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 148.10/100.77 [2019-03-28 12:40:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 62 transitions. 148.10/100.77 [2019-03-28 12:40:19,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 62 transitions. Word has length 6 148.10/100.77 [2019-03-28 12:40:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,411 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 62 transitions. 148.10/100.77 [2019-03-28 12:40:19,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 62 transitions. 148.10/100.77 [2019-03-28 12:40:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 148.10/100.77 [2019-03-28 12:40:19,412 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,412 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1179689428, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 148.10/100.77 [2019-03-28 12:40:19,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 148.10/100.77 [2019-03-28 12:40:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 148.10/100.77 [2019-03-28 12:40:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 148.10/100.77 [2019-03-28 12:40:19,496 INFO L87 Difference]: Start difference. First operand 31 states and 62 transitions. Second operand 6 states. 148.10/100.77 [2019-03-28 12:40:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,677 INFO L93 Difference]: Finished difference Result 56 states and 113 transitions. 148.10/100.77 [2019-03-28 12:40:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 148.10/100.77 [2019-03-28 12:40:19,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 148.10/100.77 [2019-03-28 12:40:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,679 INFO L225 Difference]: With dead ends: 56 148.10/100.77 [2019-03-28 12:40:19,679 INFO L226 Difference]: Without dead ends: 54 148.10/100.77 [2019-03-28 12:40:19,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 148.10/100.77 [2019-03-28 12:40:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. 148.10/100.77 [2019-03-28 12:40:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. 148.10/100.77 [2019-03-28 12:40:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 148.10/100.77 [2019-03-28 12:40:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:19,686 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 71 transitions. Word has length 7 148.10/100.77 [2019-03-28 12:40:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 148.10/100.77 [2019-03-28 12:40:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 148.10/100.77 [2019-03-28 12:40:19,687 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,687 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1179689431, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:19,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 148.10/100.77 [2019-03-28 12:40:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 148.10/100.77 [2019-03-28 12:40:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 148.10/100.77 [2019-03-28 12:40:19,720 INFO L87 Difference]: Start difference. First operand 34 states and 71 transitions. Second operand 4 states. 148.10/100.77 [2019-03-28 12:40:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,801 INFO L93 Difference]: Finished difference Result 34 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:19,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:19,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 148.10/100.77 [2019-03-28 12:40:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,802 INFO L225 Difference]: With dead ends: 34 148.10/100.77 [2019-03-28 12:40:19,803 INFO L226 Difference]: Without dead ends: 32 148.10/100.77 [2019-03-28 12:40:19,803 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 148.10/100.77 [2019-03-28 12:40:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 148.10/100.77 [2019-03-28 12:40:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 63 transitions. Word has length 7 148.10/100.77 [2019-03-28 12:40:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,808 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 148.10/100.77 [2019-03-28 12:40:19,809 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,810 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash 189758218, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:19,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:19,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:19,842 INFO L87 Difference]: Start difference. First operand 32 states and 63 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:19,901 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. 148.10/100.77 [2019-03-28 12:40:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 148.10/100.77 [2019-03-28 12:40:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:19,902 INFO L225 Difference]: With dead ends: 34 148.10/100.77 [2019-03-28 12:40:19,902 INFO L226 Difference]: Without dead ends: 32 148.10/100.77 [2019-03-28 12:40:19,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 148.10/100.77 [2019-03-28 12:40:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. 148.10/100.77 [2019-03-28 12:40:19,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 9 148.10/100.77 [2019-03-28 12:40:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:19,907 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. 148.10/100.77 [2019-03-28 12:40:19,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. 148.10/100.77 [2019-03-28 12:40:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 148.10/100.77 [2019-03-28 12:40:19,908 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:19,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:19,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 189758219, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:19,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:19,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:19,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.77 [2019-03-28 12:40:19,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:19,940 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,016 INFO L93 Difference]: Finished difference Result 32 states and 61 transitions. 148.10/100.77 [2019-03-28 12:40:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 148.10/100.77 [2019-03-28 12:40:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,017 INFO L225 Difference]: With dead ends: 32 148.10/100.77 [2019-03-28 12:40:20,017 INFO L226 Difference]: Without dead ends: 28 148.10/100.77 [2019-03-28 12:40:20,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 148.10/100.77 [2019-03-28 12:40:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 148.10/100.77 [2019-03-28 12:40:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 148.10/100.77 [2019-03-28 12:40:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. 148.10/100.77 [2019-03-28 12:40:20,022 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 55 transitions. Word has length 9 148.10/100.77 [2019-03-28 12:40:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,022 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 55 transitions. 148.10/100.77 [2019-03-28 12:40:20,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 55 transitions. 148.10/100.77 [2019-03-28 12:40:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 148.10/100.77 [2019-03-28 12:40:20,023 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1587606855, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:20,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 148.10/100.77 [2019-03-28 12:40:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 148.10/100.77 [2019-03-28 12:40:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 148.10/100.77 [2019-03-28 12:40:20,061 INFO L87 Difference]: Start difference. First operand 28 states and 55 transitions. Second operand 4 states. 148.10/100.77 [2019-03-28 12:40:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,138 INFO L93 Difference]: Finished difference Result 28 states and 55 transitions. 148.10/100.77 [2019-03-28 12:40:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:20,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,139 INFO L225 Difference]: With dead ends: 28 148.10/100.77 [2019-03-28 12:40:20,139 INFO L226 Difference]: Without dead ends: 25 148.10/100.77 [2019-03-28 12:40:20,139 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 148.10/100.77 [2019-03-28 12:40:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 148.10/100.77 [2019-03-28 12:40:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 148.10/100.77 [2019-03-28 12:40:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 148.10/100.77 [2019-03-28 12:40:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. 148.10/100.77 [2019-03-28 12:40:20,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,144 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 49 transitions. 148.10/100.77 [2019-03-28 12:40:20,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 148.10/100.77 [2019-03-28 12:40:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 49 transitions. 148.10/100.77 [2019-03-28 12:40:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 148.10/100.77 [2019-03-28 12:40:20,144 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,145 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1587606857, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 148.10/100.77 [2019-03-28 12:40:20,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 148.10/100.77 [2019-03-28 12:40:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 148.10/100.77 [2019-03-28 12:40:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 148.10/100.77 [2019-03-28 12:40:20,180 INFO L87 Difference]: Start difference. First operand 25 states and 49 transitions. Second operand 5 states. 148.10/100.77 [2019-03-28 12:40:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,277 INFO L93 Difference]: Finished difference Result 42 states and 80 transitions. 148.10/100.77 [2019-03-28 12:40:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 148.10/100.77 [2019-03-28 12:40:20,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,279 INFO L225 Difference]: With dead ends: 42 148.10/100.77 [2019-03-28 12:40:20,279 INFO L226 Difference]: Without dead ends: 39 148.10/100.77 [2019-03-28 12:40:20,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 148.10/100.77 [2019-03-28 12:40:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 148.10/100.77 [2019-03-28 12:40:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. 148.10/100.77 [2019-03-28 12:40:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,284 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 71 transitions. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,284 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 148.10/100.77 [2019-03-28 12:40:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 148.10/100.77 [2019-03-28 12:40:20,285 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1587606858, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 148.10/100.77 [2019-03-28 12:40:20,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 148.10/100.77 [2019-03-28 12:40:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 148.10/100.77 [2019-03-28 12:40:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 148.10/100.77 [2019-03-28 12:40:20,345 INFO L87 Difference]: Start difference. First operand 32 states and 71 transitions. Second operand 6 states. 148.10/100.77 [2019-03-28 12:40:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,489 INFO L93 Difference]: Finished difference Result 39 states and 77 transitions. 148.10/100.77 [2019-03-28 12:40:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 148.10/100.77 [2019-03-28 12:40:20,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,491 INFO L225 Difference]: With dead ends: 39 148.10/100.77 [2019-03-28 12:40:20,491 INFO L226 Difference]: Without dead ends: 36 148.10/100.77 [2019-03-28 12:40:20,491 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 148.10/100.77 [2019-03-28 12:40:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 148.10/100.77 [2019-03-28 12:40:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. 148.10/100.77 [2019-03-28 12:40:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 148.10/100.77 [2019-03-28 12:40:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:20,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 68 transitions. Word has length 10 148.10/100.77 [2019-03-28 12:40:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,496 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:20,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 148.10/100.77 [2019-03-28 12:40:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 68 transitions. 148.10/100.77 [2019-03-28 12:40:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 148.10/100.77 [2019-03-28 12:40:20,497 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,498 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1985994965, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:20,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:20,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:20,526 INFO L87 Difference]: Start difference. First operand 32 states and 68 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,592 INFO L93 Difference]: Finished difference Result 59 states and 129 transitions. 148.10/100.77 [2019-03-28 12:40:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 148.10/100.77 [2019-03-28 12:40:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,593 INFO L225 Difference]: With dead ends: 59 148.10/100.77 [2019-03-28 12:40:20,593 INFO L226 Difference]: Without dead ends: 36 148.10/100.77 [2019-03-28 12:40:20,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 148.10/100.77 [2019-03-28 12:40:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. 148.10/100.77 [2019-03-28 12:40:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 148.10/100.77 [2019-03-28 12:40:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 71 transitions. Word has length 14 148.10/100.77 [2019-03-28 12:40:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,599 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 71 transitions. 148.10/100.77 [2019-03-28 12:40:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 148.10/100.77 [2019-03-28 12:40:20,600 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,600 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1985935383, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.77 [2019-03-28 12:40:20,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.77 [2019-03-28 12:40:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.77 [2019-03-28 12:40:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:20,636 INFO L87 Difference]: Start difference. First operand 35 states and 71 transitions. Second operand 3 states. 148.10/100.77 [2019-03-28 12:40:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:20,702 INFO L93 Difference]: Finished difference Result 61 states and 127 transitions. 148.10/100.77 [2019-03-28 12:40:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 148.10/100.77 [2019-03-28 12:40:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:20,703 INFO L225 Difference]: With dead ends: 61 148.10/100.77 [2019-03-28 12:40:20,703 INFO L226 Difference]: Without dead ends: 35 148.10/100.77 [2019-03-28 12:40:20,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.77 [2019-03-28 12:40:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 148.10/100.77 [2019-03-28 12:40:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 148.10/100.77 [2019-03-28 12:40:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 148.10/100.77 [2019-03-28 12:40:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:20,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 14 148.10/100.77 [2019-03-28 12:40:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:20,709 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:20,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.77 [2019-03-28 12:40:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. 148.10/100.77 [2019-03-28 12:40:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 148.10/100.77 [2019-03-28 12:40:20,709 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:20,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:20,710 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:20,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:20,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1576487831, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:20,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:20,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:20,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:20,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:20,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:20,891 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 148.10/100.77 [2019-03-28 12:40:20,892 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:20,897 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:20,897 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:20,897 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 148.10/100.77 [2019-03-28 12:40:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:20,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 148.10/100.77 [2019-03-28 12:40:20,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 148.10/100.77 [2019-03-28 12:40:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 148.10/100.77 [2019-03-28 12:40:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 148.10/100.77 [2019-03-28 12:40:20,941 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 9 states. 148.10/100.77 [2019-03-28 12:40:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:21,389 INFO L93 Difference]: Finished difference Result 90 states and 172 transitions. 148.10/100.77 [2019-03-28 12:40:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 148.10/100.77 [2019-03-28 12:40:21,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 148.10/100.77 [2019-03-28 12:40:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:21,390 INFO L225 Difference]: With dead ends: 90 148.10/100.77 [2019-03-28 12:40:21,390 INFO L226 Difference]: Without dead ends: 64 148.10/100.77 [2019-03-28 12:40:21,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 148.10/100.77 [2019-03-28 12:40:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. 148.10/100.77 [2019-03-28 12:40:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. 148.10/100.77 [2019-03-28 12:40:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 148.10/100.77 [2019-03-28 12:40:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 81 transitions. 148.10/100.77 [2019-03-28 12:40:21,397 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 81 transitions. Word has length 16 148.10/100.77 [2019-03-28 12:40:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:21,397 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 81 transitions. 148.10/100.77 [2019-03-28 12:40:21,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 148.10/100.77 [2019-03-28 12:40:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 81 transitions. 148.10/100.77 [2019-03-28 12:40:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 148.10/100.77 [2019-03-28 12:40:21,398 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:21,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:21,398 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1576486869, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:21,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:21,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:21,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 148.10/100.77 [2019-03-28 12:40:21,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 148.10/100.77 [2019-03-28 12:40:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 148.10/100.77 [2019-03-28 12:40:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 148.10/100.77 [2019-03-28 12:40:21,525 INFO L87 Difference]: Start difference. First operand 41 states and 81 transitions. Second operand 9 states. 148.10/100.77 [2019-03-28 12:40:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:21,743 INFO L93 Difference]: Finished difference Result 93 states and 176 transitions. 148.10/100.77 [2019-03-28 12:40:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 148.10/100.77 [2019-03-28 12:40:21,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 148.10/100.77 [2019-03-28 12:40:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:21,744 INFO L225 Difference]: With dead ends: 93 148.10/100.77 [2019-03-28 12:40:21,744 INFO L226 Difference]: Without dead ends: 61 148.10/100.77 [2019-03-28 12:40:21,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 148.10/100.77 [2019-03-28 12:40:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. 148.10/100.77 [2019-03-28 12:40:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. 148.10/100.77 [2019-03-28 12:40:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 148.10/100.77 [2019-03-28 12:40:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 105 transitions. 148.10/100.77 [2019-03-28 12:40:21,751 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 105 transitions. Word has length 16 148.10/100.77 [2019-03-28 12:40:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:21,751 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 105 transitions. 148.10/100.77 [2019-03-28 12:40:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 148.10/100.77 [2019-03-28 12:40:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 105 transitions. 148.10/100.77 [2019-03-28 12:40:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 148.10/100.77 [2019-03-28 12:40:21,752 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:21,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:21,753 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1518553322, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:21,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 148.10/100.77 [2019-03-28 12:40:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 148.10/100.77 [2019-03-28 12:40:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 148.10/100.77 [2019-03-28 12:40:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 148.10/100.77 [2019-03-28 12:40:21,840 INFO L87 Difference]: Start difference. First operand 56 states and 105 transitions. Second operand 8 states. 148.10/100.77 [2019-03-28 12:40:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:22,082 INFO L93 Difference]: Finished difference Result 100 states and 183 transitions. 148.10/100.77 [2019-03-28 12:40:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.77 [2019-03-28 12:40:22,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 148.10/100.77 [2019-03-28 12:40:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:22,083 INFO L225 Difference]: With dead ends: 100 148.10/100.77 [2019-03-28 12:40:22,083 INFO L226 Difference]: Without dead ends: 43 148.10/100.77 [2019-03-28 12:40:22,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 148.10/100.77 [2019-03-28 12:40:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 148.10/100.77 [2019-03-28 12:40:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. 148.10/100.77 [2019-03-28 12:40:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 148.10/100.77 [2019-03-28 12:40:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. 148.10/100.77 [2019-03-28 12:40:22,089 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 16 148.10/100.77 [2019-03-28 12:40:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 80 transitions. 148.10/100.77 [2019-03-28 12:40:22,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 148.10/100.77 [2019-03-28 12:40:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 80 transitions. 148.10/100.77 [2019-03-28 12:40:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 148.10/100.77 [2019-03-28 12:40:22,090 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:22,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:22,090 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1702801144, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:22,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:22,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:22,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:22,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:22,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:22,365 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 148.10/100.77 [2019-03-28 12:40:22,366 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:22,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:22,377 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. 148.10/100.77 [2019-03-28 12:40:22,377 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 148.10/100.77 [2019-03-28 12:40:22,457 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:22,458 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 148.10/100.77 [2019-03-28 12:40:22,462 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.77 [2019-03-28 12:40:22,475 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:22,480 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 148.10/100.77 [2019-03-28 12:40:22,480 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 148.10/100.77 [2019-03-28 12:40:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:22,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 148.10/100.77 [2019-03-28 12:40:22,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 148.10/100.77 [2019-03-28 12:40:22,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 148.10/100.77 [2019-03-28 12:40:22,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 148.10/100.77 [2019-03-28 12:40:22,581 INFO L87 Difference]: Start difference. First operand 42 states and 80 transitions. Second operand 15 states. 148.10/100.77 [2019-03-28 12:40:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:23,606 INFO L93 Difference]: Finished difference Result 53 states and 93 transitions. 148.10/100.77 [2019-03-28 12:40:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 148.10/100.77 [2019-03-28 12:40:23,606 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 148.10/100.77 [2019-03-28 12:40:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:23,607 INFO L225 Difference]: With dead ends: 53 148.10/100.77 [2019-03-28 12:40:23,607 INFO L226 Difference]: Without dead ends: 47 148.10/100.77 [2019-03-28 12:40:23,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 148.10/100.77 [2019-03-28 12:40:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 148.10/100.77 [2019-03-28 12:40:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. 148.10/100.77 [2019-03-28 12:40:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 148.10/100.77 [2019-03-28 12:40:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. 148.10/100.77 [2019-03-28 12:40:23,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 16 148.10/100.77 [2019-03-28 12:40:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:23,615 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. 148.10/100.77 [2019-03-28 12:40:23,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 148.10/100.77 [2019-03-28 12:40:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. 148.10/100.77 [2019-03-28 12:40:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 148.10/100.77 [2019-03-28 12:40:23,622 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:23,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:23,623 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash 13846569, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:23,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:23,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:23,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:23,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:23,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 148.10/100.77 [2019-03-28 12:40:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 148.10/100.77 [2019-03-28 12:40:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 148.10/100.77 [2019-03-28 12:40:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 148.10/100.77 [2019-03-28 12:40:23,693 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand 8 states. 148.10/100.77 [2019-03-28 12:40:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:23,977 INFO L93 Difference]: Finished difference Result 106 states and 206 transitions. 148.10/100.77 [2019-03-28 12:40:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.77 [2019-03-28 12:40:23,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 148.10/100.77 [2019-03-28 12:40:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:23,996 INFO L225 Difference]: With dead ends: 106 148.10/100.77 [2019-03-28 12:40:23,996 INFO L226 Difference]: Without dead ends: 75 148.10/100.77 [2019-03-28 12:40:23,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 148.10/100.77 [2019-03-28 12:40:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. 148.10/100.77 [2019-03-28 12:40:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. 148.10/100.77 [2019-03-28 12:40:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. 148.10/100.77 [2019-03-28 12:40:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 123 transitions. 148.10/100.77 [2019-03-28 12:40:24,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 123 transitions. Word has length 18 148.10/100.77 [2019-03-28 12:40:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:24,005 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 123 transitions. 148.10/100.77 [2019-03-28 12:40:24,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 148.10/100.77 [2019-03-28 12:40:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 123 transitions. 148.10/100.77 [2019-03-28 12:40:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 148.10/100.77 [2019-03-28 12:40:24,006 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:24,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:24,006 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1752962820, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:24,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:24,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:24,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:24,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:24,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:24,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:24,312 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 148.10/100.77 [2019-03-28 12:40:24,312 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:24,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:24,324 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. 148.10/100.77 [2019-03-28 12:40:24,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 148.10/100.77 [2019-03-28 12:40:24,361 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:24,363 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 148.10/100.77 [2019-03-28 12:40:24,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:24,380 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:24,382 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. 148.10/100.77 [2019-03-28 12:40:24,383 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:42 148.10/100.77 [2019-03-28 12:40:24,428 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:24,435 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:24,435 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 148.10/100.77 [2019-03-28 12:40:24,437 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.77 [2019-03-28 12:40:24,451 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:24,454 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:24,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:31 148.10/100.77 [2019-03-28 12:40:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 148.10/100.77 [2019-03-28 12:40:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 148.10/100.77 [2019-03-28 12:40:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 148.10/100.77 [2019-03-28 12:40:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 148.10/100.77 [2019-03-28 12:40:24,594 INFO L87 Difference]: Start difference. First operand 58 states and 123 transitions. Second operand 17 states. 148.10/100.77 [2019-03-28 12:40:25,185 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 148.10/100.77 [2019-03-28 12:40:25,564 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 148.10/100.77 [2019-03-28 12:40:25,693 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 148.10/100.77 [2019-03-28 12:40:25,963 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 148.10/100.77 [2019-03-28 12:40:26,116 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 148.10/100.77 [2019-03-28 12:40:26,396 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 148.10/100.77 [2019-03-28 12:40:26,544 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 148.10/100.77 [2019-03-28 12:40:26,875 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 148.10/100.77 [2019-03-28 12:40:27,077 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 148.10/100.77 [2019-03-28 12:40:27,285 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 148.10/100.77 [2019-03-28 12:40:27,614 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 148.10/100.77 [2019-03-28 12:40:27,783 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 148.10/100.77 [2019-03-28 12:40:27,924 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 148.10/100.77 [2019-03-28 12:40:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:28,568 INFO L93 Difference]: Finished difference Result 302 states and 652 transitions. 148.10/100.77 [2019-03-28 12:40:28,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 148.10/100.77 [2019-03-28 12:40:28,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 148.10/100.77 [2019-03-28 12:40:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:28,571 INFO L225 Difference]: With dead ends: 302 148.10/100.77 [2019-03-28 12:40:28,571 INFO L226 Difference]: Without dead ends: 300 148.10/100.77 [2019-03-28 12:40:28,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=577, Invalid=1315, Unknown=0, NotChecked=0, Total=1892 148.10/100.77 [2019-03-28 12:40:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. 148.10/100.77 [2019-03-28 12:40:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 100. 148.10/100.77 [2019-03-28 12:40:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. 148.10/100.77 [2019-03-28 12:40:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 220 transitions. 148.10/100.77 [2019-03-28 12:40:28,588 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 220 transitions. Word has length 18 148.10/100.77 [2019-03-28 12:40:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:28,588 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 220 transitions. 148.10/100.77 [2019-03-28 12:40:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 148.10/100.77 [2019-03-28 12:40:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 220 transitions. 148.10/100.77 [2019-03-28 12:40:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 148.10/100.77 [2019-03-28 12:40:28,589 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:28,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:28,590 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1752962819, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:28,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:28,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:28,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:28,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:28,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:28,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:28,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:28,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:28,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 148.10/100.77 [2019-03-28 12:40:28,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 148.10/100.77 [2019-03-28 12:40:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 148.10/100.77 [2019-03-28 12:40:28,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 148.10/100.77 [2019-03-28 12:40:28,704 INFO L87 Difference]: Start difference. First operand 100 states and 220 transitions. Second operand 6 states. 148.10/100.77 [2019-03-28 12:40:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:28,841 INFO L93 Difference]: Finished difference Result 102 states and 220 transitions. 148.10/100.77 [2019-03-28 12:40:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 148.10/100.77 [2019-03-28 12:40:28,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 148.10/100.77 [2019-03-28 12:40:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:28,843 INFO L225 Difference]: With dead ends: 102 148.10/100.77 [2019-03-28 12:40:28,843 INFO L226 Difference]: Without dead ends: 100 148.10/100.77 [2019-03-28 12:40:28,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 148.10/100.77 [2019-03-28 12:40:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. 148.10/100.77 [2019-03-28 12:40:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. 148.10/100.77 [2019-03-28 12:40:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. 148.10/100.77 [2019-03-28 12:40:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 216 transitions. 148.10/100.77 [2019-03-28 12:40:28,857 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 216 transitions. Word has length 18 148.10/100.77 [2019-03-28 12:40:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:28,857 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 216 transitions. 148.10/100.77 [2019-03-28 12:40:28,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 148.10/100.77 [2019-03-28 12:40:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 216 transitions. 148.10/100.77 [2019-03-28 12:40:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 148.10/100.77 [2019-03-28 12:40:28,858 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:28,858 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:28,859 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1535903911, now seen corresponding path program 2 times 148.10/100.77 [2019-03-28 12:40:28,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:28,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:29,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:29,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:29,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 148.10/100.77 [2019-03-28 12:40:29,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 148.10/100.77 [2019-03-28 12:40:29,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:29,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:29,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:29,205 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 148.10/100.77 [2019-03-28 12:40:29,206 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:29,227 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 148.10/100.77 [2019-03-28 12:40:29,228 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:29,228 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 148.10/100.77 [2019-03-28 12:40:29,253 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 148.10/100.77 [2019-03-28 12:40:29,253 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:29,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:29,260 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. 148.10/100.77 [2019-03-28 12:40:29,261 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 148.10/100.77 [2019-03-28 12:40:29,339 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:29,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 148.10/100.77 [2019-03-28 12:40:29,341 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.77 [2019-03-28 12:40:29,357 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:29,359 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:29,359 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 148.10/100.77 [2019-03-28 12:40:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:29,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:29,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 148.10/100.77 [2019-03-28 12:40:29,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 148.10/100.77 [2019-03-28 12:40:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 148.10/100.77 [2019-03-28 12:40:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 148.10/100.77 [2019-03-28 12:40:29,440 INFO L87 Difference]: Start difference. First operand 99 states and 216 transitions. Second operand 15 states. 148.10/100.77 [2019-03-28 12:40:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:30,340 INFO L93 Difference]: Finished difference Result 113 states and 235 transitions. 148.10/100.77 [2019-03-28 12:40:30,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 148.10/100.77 [2019-03-28 12:40:30,341 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 148.10/100.77 [2019-03-28 12:40:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:30,342 INFO L225 Difference]: With dead ends: 113 148.10/100.77 [2019-03-28 12:40:30,342 INFO L226 Difference]: Without dead ends: 112 148.10/100.77 [2019-03-28 12:40:30,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 148.10/100.77 [2019-03-28 12:40:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. 148.10/100.77 [2019-03-28 12:40:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 58. 148.10/100.77 [2019-03-28 12:40:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. 148.10/100.77 [2019-03-28 12:40:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. 148.10/100.77 [2019-03-28 12:40:30,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 22 148.10/100.77 [2019-03-28 12:40:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:30,352 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. 148.10/100.77 [2019-03-28 12:40:30,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 148.10/100.77 [2019-03-28 12:40:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. 148.10/100.77 [2019-03-28 12:40:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 148.10/100.77 [2019-03-28 12:40:30,353 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:30,353 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:30,354 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash 823947167, now seen corresponding path program 2 times 148.10/100.77 [2019-03-28 12:40:30,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:30,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:30,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:30,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:30,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:30,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 148.10/100.77 [2019-03-28 12:40:30,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 148.10/100.77 [2019-03-28 12:40:30,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:30,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:30,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:30,731 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:30,732 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 148.10/100.77 [2019-03-28 12:40:30,733 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,743 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:30,743 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,744 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 148.10/100.77 [2019-03-28 12:40:30,775 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 148.10/100.77 [2019-03-28 12:40:30,775 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,787 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:30,788 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. 148.10/100.77 [2019-03-28 12:40:30,788 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 148.10/100.77 [2019-03-28 12:40:30,826 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:30,827 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 148.10/100.77 [2019-03-28 12:40:30,827 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,840 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:30,841 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,841 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 148.10/100.77 [2019-03-28 12:40:30,904 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:30,909 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:30,910 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 148.10/100.77 [2019-03-28 12:40:30,911 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,926 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:30,927 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:30,927 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:27 148.10/100.77 [2019-03-28 12:40:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:31,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:31,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 148.10/100.77 [2019-03-28 12:40:31,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 148.10/100.77 [2019-03-28 12:40:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 148.10/100.77 [2019-03-28 12:40:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 148.10/100.77 [2019-03-28 12:40:31,055 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 18 states. 148.10/100.77 [2019-03-28 12:40:33,917 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 148.10/100.77 [2019-03-28 12:40:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:34,659 INFO L93 Difference]: Finished difference Result 189 states and 390 transitions. 148.10/100.77 [2019-03-28 12:40:34,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 148.10/100.77 [2019-03-28 12:40:34,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 148.10/100.77 [2019-03-28 12:40:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:34,661 INFO L225 Difference]: With dead ends: 189 148.10/100.77 [2019-03-28 12:40:34,661 INFO L226 Difference]: Without dead ends: 188 148.10/100.77 [2019-03-28 12:40:34,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=540, Invalid=1622, Unknown=0, NotChecked=0, Total=2162 148.10/100.77 [2019-03-28 12:40:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. 148.10/100.77 [2019-03-28 12:40:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 151. 148.10/100.77 [2019-03-28 12:40:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. 148.10/100.77 [2019-03-28 12:40:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 311 transitions. 148.10/100.77 [2019-03-28 12:40:34,683 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 311 transitions. Word has length 29 148.10/100.77 [2019-03-28 12:40:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:34,683 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 311 transitions. 148.10/100.77 [2019-03-28 12:40:34,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 148.10/100.77 [2019-03-28 12:40:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 311 transitions. 148.10/100.77 [2019-03-28 12:40:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 148.10/100.77 [2019-03-28 12:40:34,684 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:34,685 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:34,685 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1423959030, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:34,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:34,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:34,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:34,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:34,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:34,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:34,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:34,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 19 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:34,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:34,826 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 148.10/100.77 [2019-03-28 12:40:34,827 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:34,829 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:34,829 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. 148.10/100.77 [2019-03-28 12:40:34,830 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 148.10/100.77 [2019-03-28 12:40:35,490 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:35,490 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 148.10/100.77 [2019-03-28 12:40:35,492 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:35,497 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:35,497 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:35,497 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 148.10/100.77 [2019-03-28 12:40:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:35,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:35,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 148.10/100.77 [2019-03-28 12:40:35,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 148.10/100.77 [2019-03-28 12:40:35,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 148.10/100.77 [2019-03-28 12:40:35,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 148.10/100.77 [2019-03-28 12:40:35,532 INFO L87 Difference]: Start difference. First operand 151 states and 311 transitions. Second operand 13 states. 148.10/100.77 [2019-03-28 12:40:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:36,078 INFO L93 Difference]: Finished difference Result 588 states and 1166 transitions. 148.10/100.77 [2019-03-28 12:40:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.77 [2019-03-28 12:40:36,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 148.10/100.77 [2019-03-28 12:40:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:36,081 INFO L225 Difference]: With dead ends: 588 148.10/100.77 [2019-03-28 12:40:36,081 INFO L226 Difference]: Without dead ends: 502 148.10/100.77 [2019-03-28 12:40:36,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=256, Unknown=1, NotChecked=0, Total=342 148.10/100.77 [2019-03-28 12:40:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. 148.10/100.77 [2019-03-28 12:40:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 321. 148.10/100.77 [2019-03-28 12:40:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. 148.10/100.77 [2019-03-28 12:40:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 647 transitions. 148.10/100.77 [2019-03-28 12:40:36,153 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 647 transitions. Word has length 40 148.10/100.77 [2019-03-28 12:40:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:36,154 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 647 transitions. 148.10/100.77 [2019-03-28 12:40:36,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 148.10/100.77 [2019-03-28 12:40:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 647 transitions. 148.10/100.77 [2019-03-28 12:40:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 148.10/100.77 [2019-03-28 12:40:36,155 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:36,155 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:36,156 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash 315157221, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:36,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:36,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:36,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:36,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 148.10/100.77 [2019-03-28 12:40:36,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 148.10/100.77 [2019-03-28 12:40:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 148.10/100.77 [2019-03-28 12:40:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 148.10/100.77 [2019-03-28 12:40:36,226 INFO L87 Difference]: Start difference. First operand 321 states and 647 transitions. Second operand 8 states. 148.10/100.77 [2019-03-28 12:40:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:36,560 INFO L93 Difference]: Finished difference Result 655 states and 1198 transitions. 148.10/100.77 [2019-03-28 12:40:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.77 [2019-03-28 12:40:36,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 148.10/100.77 [2019-03-28 12:40:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:36,564 INFO L225 Difference]: With dead ends: 655 148.10/100.77 [2019-03-28 12:40:36,564 INFO L226 Difference]: Without dead ends: 406 148.10/100.77 [2019-03-28 12:40:36,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 148.10/100.77 [2019-03-28 12:40:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. 148.10/100.77 [2019-03-28 12:40:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 321. 148.10/100.77 [2019-03-28 12:40:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. 148.10/100.77 [2019-03-28 12:40:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 623 transitions. 148.10/100.77 [2019-03-28 12:40:36,617 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 623 transitions. Word has length 40 148.10/100.77 [2019-03-28 12:40:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:36,618 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 623 transitions. 148.10/100.77 [2019-03-28 12:40:36,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 148.10/100.77 [2019-03-28 12:40:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 623 transitions. 148.10/100.77 [2019-03-28 12:40:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 148.10/100.77 [2019-03-28 12:40:36,619 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:36,619 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:36,620 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:36,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:36,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1286750154, now seen corresponding path program 1 times 148.10/100.77 [2019-03-28 12:40:36,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.77 [2019-03-28 12:40:36,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.77 [2019-03-28 12:40:36,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:37,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.77 [2019-03-28 12:40:37,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.77 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.77 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.77 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.77 [2019-03-28 12:40:37,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.77 [2019-03-28 12:40:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.77 [2019-03-28 12:40:37,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core 148.10/100.77 [2019-03-28 12:40:37,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.77 [2019-03-28 12:40:37,058 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:37,060 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 148.10/100.77 [2019-03-28 12:40:37,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,068 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:37,069 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,069 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 148.10/100.77 [2019-03-28 12:40:37,099 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 148.10/100.77 [2019-03-28 12:40:37,100 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,106 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:37,106 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,107 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 148.10/100.77 [2019-03-28 12:40:37,138 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:37,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 148.10/100.77 [2019-03-28 12:40:37,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,147 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:37,147 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. 148.10/100.77 [2019-03-28 12:40:37,148 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 148.10/100.77 [2019-03-28 12:40:37,484 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.77 [2019-03-28 12:40:37,496 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.77 [2019-03-28 12:40:37,496 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 41 148.10/100.77 [2019-03-28 12:40:37,497 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,526 INFO L497 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size 148.10/100.77 [2019-03-28 12:40:37,526 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.77 [2019-03-28 12:40:37,527 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:26 148.10/100.77 [2019-03-28 12:40:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 148.10/100.77 [2019-03-28 12:40:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.77 [2019-03-28 12:40:37,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 148.10/100.77 [2019-03-28 12:40:37,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states 148.10/100.77 [2019-03-28 12:40:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. 148.10/100.77 [2019-03-28 12:40:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 148.10/100.77 [2019-03-28 12:40:37,640 INFO L87 Difference]: Start difference. First operand 321 states and 623 transitions. Second operand 28 states. 148.10/100.77 [2019-03-28 12:40:38,547 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 148.10/100.77 [2019-03-28 12:40:40,766 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 148.10/100.77 [2019-03-28 12:40:41,397 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 148.10/100.77 [2019-03-28 12:40:41,976 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 148.10/100.77 [2019-03-28 12:40:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.77 [2019-03-28 12:40:42,618 INFO L93 Difference]: Finished difference Result 792 states and 1511 transitions. 148.10/100.77 [2019-03-28 12:40:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 148.10/100.77 [2019-03-28 12:40:42,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 148.10/100.77 [2019-03-28 12:40:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.77 [2019-03-28 12:40:42,623 INFO L225 Difference]: With dead ends: 792 148.10/100.77 [2019-03-28 12:40:42,623 INFO L226 Difference]: Without dead ends: 791 148.10/100.77 [2019-03-28 12:40:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1294, Invalid=3398, Unknown=0, NotChecked=0, Total=4692 148.10/100.77 [2019-03-28 12:40:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. 148.10/100.77 [2019-03-28 12:40:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 384. 148.10/100.77 [2019-03-28 12:40:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. 148.10/100.77 [2019-03-28 12:40:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 753 transitions. 148.10/100.77 [2019-03-28 12:40:42,693 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 753 transitions. Word has length 40 148.10/100.77 [2019-03-28 12:40:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.77 [2019-03-28 12:40:42,693 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 753 transitions. 148.10/100.77 [2019-03-28 12:40:42,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. 148.10/100.77 [2019-03-28 12:40:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 753 transitions. 148.10/100.77 [2019-03-28 12:40:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 148.10/100.77 [2019-03-28 12:40:42,694 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.77 [2019-03-28 12:40:42,695 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 148.10/100.77 [2019-03-28 12:40:42,695 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.77 [2019-03-28 12:40:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.77 [2019-03-28 12:40:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1853092955, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:40:42,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:40:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:40:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:42,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:42,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.78 [2019-03-28 12:40:42,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.78 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.78 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.78 [2019-03-28 12:40:43,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:43,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 30 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:40:43,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:40:43,052 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.78 [2019-03-28 12:40:43,053 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 148.10/100.78 [2019-03-28 12:40:43,053 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,060 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,066 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 148.10/100.78 [2019-03-28 12:40:43,067 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,072 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,073 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,073 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 148.10/100.78 [2019-03-28 12:40:43,099 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 15 treesize of output 11 148.10/100.78 [2019-03-28 12:40:43,099 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,104 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,104 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,105 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 148.10/100.78 [2019-03-28 12:40:43,132 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 148.10/100.78 [2019-03-28 12:40:43,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,138 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,139 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. 148.10/100.78 [2019-03-28 12:40:43,139 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 148.10/100.78 [2019-03-28 12:40:43,219 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,220 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 148.10/100.78 [2019-03-28 12:40:43,221 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,229 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:43,229 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:43,229 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 148.10/100.78 [2019-03-28 12:40:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:43,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:40:43,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 148.10/100.78 [2019-03-28 12:40:43,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 148.10/100.78 [2019-03-28 12:40:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 148.10/100.78 [2019-03-28 12:40:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 148.10/100.78 [2019-03-28 12:40:43,332 INFO L87 Difference]: Start difference. First operand 384 states and 753 transitions. Second operand 20 states. 148.10/100.78 [2019-03-28 12:40:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:40:44,975 INFO L93 Difference]: Finished difference Result 567 states and 1077 transitions. 148.10/100.78 [2019-03-28 12:40:44,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 148.10/100.78 [2019-03-28 12:40:44,976 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 148.10/100.78 [2019-03-28 12:40:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.78 [2019-03-28 12:40:44,979 INFO L225 Difference]: With dead ends: 567 148.10/100.78 [2019-03-28 12:40:44,979 INFO L226 Difference]: Without dead ends: 566 148.10/100.78 [2019-03-28 12:40:44,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 148.10/100.78 [2019-03-28 12:40:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. 148.10/100.78 [2019-03-28 12:40:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 292. 148.10/100.78 [2019-03-28 12:40:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. 148.10/100.78 [2019-03-28 12:40:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 569 transitions. 148.10/100.78 [2019-03-28 12:40:45,033 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 569 transitions. Word has length 40 148.10/100.78 [2019-03-28 12:40:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.78 [2019-03-28 12:40:45,033 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 569 transitions. 148.10/100.78 [2019-03-28 12:40:45,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 148.10/100.78 [2019-03-28 12:40:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 569 transitions. 148.10/100.78 [2019-03-28 12:40:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 148.10/100.78 [2019-03-28 12:40:45,034 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.78 [2019-03-28 12:40:45,034 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:40:45,035 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.78 [2019-03-28 12:40:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:40:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1492272567, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:40:45,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:40:45,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:40:45,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:45,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:45,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:45,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.78 [2019-03-28 12:40:45,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.78 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.78 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.78 [2019-03-28 12:40:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:45,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:40:45,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:40:45,276 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 148.10/100.78 [2019-03-28 12:40:45,276 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:45,278 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:45,278 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. 148.10/100.78 [2019-03-28 12:40:45,279 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 148.10/100.78 [2019-03-28 12:40:45,470 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:45,470 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 148.10/100.78 [2019-03-28 12:40:45,472 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.78 [2019-03-28 12:40:45,491 INFO L497 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size 148.10/100.78 [2019-03-28 12:40:45,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 148.10/100.78 [2019-03-28 12:40:45,493 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:34, output treesize:17 148.10/100.78 [2019-03-28 12:40:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:45,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:40:45,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 148.10/100.78 [2019-03-28 12:40:45,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 148.10/100.78 [2019-03-28 12:40:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 148.10/100.78 [2019-03-28 12:40:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 148.10/100.78 [2019-03-28 12:40:45,560 INFO L87 Difference]: Start difference. First operand 292 states and 569 transitions. Second operand 17 states. 148.10/100.78 [2019-03-28 12:40:46,563 WARN L188 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 148.10/100.78 [2019-03-28 12:40:48,024 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 148.10/100.78 [2019-03-28 12:40:49,069 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 148.10/100.78 [2019-03-28 12:40:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:40:49,113 INFO L93 Difference]: Finished difference Result 705 states and 1328 transitions. 148.10/100.78 [2019-03-28 12:40:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 148.10/100.78 [2019-03-28 12:40:49,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.78 [2019-03-28 12:40:49,116 INFO L225 Difference]: With dead ends: 705 148.10/100.78 [2019-03-28 12:40:49,116 INFO L226 Difference]: Without dead ends: 562 148.10/100.78 [2019-03-28 12:40:49,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 148.10/100.78 [2019-03-28 12:40:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. 148.10/100.78 [2019-03-28 12:40:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 408. 148.10/100.78 [2019-03-28 12:40:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. 148.10/100.78 [2019-03-28 12:40:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 826 transitions. 148.10/100.78 [2019-03-28 12:40:49,186 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 826 transitions. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.78 [2019-03-28 12:40:49,186 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 826 transitions. 148.10/100.78 [2019-03-28 12:40:49,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 148.10/100.78 [2019-03-28 12:40:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 826 transitions. 148.10/100.78 [2019-03-28 12:40:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 148.10/100.78 [2019-03-28 12:40:49,188 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.78 [2019-03-28 12:40:49,188 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:40:49,188 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.78 [2019-03-28 12:40:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:40:49,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1005743370, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:40:49,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:40:49,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:40:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:49,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.78 [2019-03-28 12:40:49,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.78 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.78 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.78 [2019-03-28 12:40:49,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:49,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:40:49,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:40:49,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 148.10/100.78 [2019-03-28 12:40:49,338 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:49,340 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:49,340 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:49,340 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 148.10/100.78 [2019-03-28 12:40:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:49,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:40:49,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 148.10/100.78 [2019-03-28 12:40:49,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 148.10/100.78 [2019-03-28 12:40:49,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 148.10/100.78 [2019-03-28 12:40:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 148.10/100.78 [2019-03-28 12:40:49,370 INFO L87 Difference]: Start difference. First operand 408 states and 826 transitions. Second operand 9 states. 148.10/100.78 [2019-03-28 12:40:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:40:49,599 INFO L93 Difference]: Finished difference Result 882 states and 1703 transitions. 148.10/100.78 [2019-03-28 12:40:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 148.10/100.78 [2019-03-28 12:40:49,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.78 [2019-03-28 12:40:49,602 INFO L225 Difference]: With dead ends: 882 148.10/100.78 [2019-03-28 12:40:49,602 INFO L226 Difference]: Without dead ends: 504 148.10/100.78 [2019-03-28 12:40:49,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 148.10/100.78 [2019-03-28 12:40:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. 148.10/100.78 [2019-03-28 12:40:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 408. 148.10/100.78 [2019-03-28 12:40:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. 148.10/100.78 [2019-03-28 12:40:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 743 transitions. 148.10/100.78 [2019-03-28 12:40:49,671 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 743 transitions. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.78 [2019-03-28 12:40:49,671 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 743 transitions. 148.10/100.78 [2019-03-28 12:40:49,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 148.10/100.78 [2019-03-28 12:40:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 743 transitions. 148.10/100.78 [2019-03-28 12:40:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 148.10/100.78 [2019-03-28 12:40:49,672 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.78 [2019-03-28 12:40:49,673 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:40:49,673 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.78 [2019-03-28 12:40:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:40:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1887094770, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:40:49,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:40:49,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:40:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:49,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:40:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.78 [2019-03-28 12:40:49,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 148.10/100.78 [2019-03-28 12:40:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.78 [2019-03-28 12:40:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.78 [2019-03-28 12:40:49,705 INFO L87 Difference]: Start difference. First operand 408 states and 743 transitions. Second operand 3 states. 148.10/100.78 [2019-03-28 12:40:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:40:49,865 INFO L93 Difference]: Finished difference Result 1058 states and 1953 transitions. 148.10/100.78 [2019-03-28 12:40:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.78 [2019-03-28 12:40:49,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.78 [2019-03-28 12:40:49,869 INFO L225 Difference]: With dead ends: 1058 148.10/100.78 [2019-03-28 12:40:49,869 INFO L226 Difference]: Without dead ends: 542 148.10/100.78 [2019-03-28 12:40:49,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.78 [2019-03-28 12:40:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. 148.10/100.78 [2019-03-28 12:40:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 444. 148.10/100.78 [2019-03-28 12:40:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. 148.10/100.78 [2019-03-28 12:40:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 749 transitions. 148.10/100.78 [2019-03-28 12:40:49,943 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 749 transitions. Word has length 46 148.10/100.78 [2019-03-28 12:40:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.78 [2019-03-28 12:40:49,943 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 749 transitions. 148.10/100.78 [2019-03-28 12:40:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 148.10/100.78 [2019-03-28 12:40:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 749 transitions. 148.10/100.78 [2019-03-28 12:40:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 148.10/100.78 [2019-03-28 12:40:49,945 INFO L394 BasicCegarLoop]: Found error trace 148.10/100.78 [2019-03-28 12:40:49,945 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:40:49,945 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== 148.10/100.78 [2019-03-28 12:40:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:40:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1311985745, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:40:49,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:40:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:40:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:50,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 148.10/100.78 [2019-03-28 12:40:50,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 148.10/100.78 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 148.10/100.78 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 148.10/100.78 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 148.10/100.78 [2019-03-28 12:40:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:40:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:40:50,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:40:50,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:40:50,273 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.78 [2019-03-28 12:40:50,274 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 148.10/100.78 [2019-03-28 12:40:50,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,288 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:50,289 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,289 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 148.10/100.78 [2019-03-28 12:40:50,322 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 148.10/100.78 [2019-03-28 12:40:50,322 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,334 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:50,334 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. 148.10/100.78 [2019-03-28 12:40:50,335 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 148.10/100.78 [2019-03-28 12:40:50,373 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.78 [2019-03-28 12:40:50,375 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 148.10/100.78 [2019-03-28 12:40:50,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,390 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:50,391 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. 148.10/100.78 [2019-03-28 12:40:50,391 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 148.10/100.78 [2019-03-28 12:40:50,453 INFO L189 IndexEqualityManager]: detected not equals via solver 148.10/100.78 [2019-03-28 12:40:50,459 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:50,460 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 148.10/100.78 [2019-03-28 12:40:50,461 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,474 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 148.10/100.78 [2019-03-28 12:40:50,475 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 148.10/100.78 [2019-03-28 12:40:50,475 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 148.10/100.78 [2019-03-28 12:40:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:40:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:40:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 148.10/100.78 [2019-03-28 12:40:50,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 148.10/100.78 [2019-03-28 12:40:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 148.10/100.78 [2019-03-28 12:40:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 148.10/100.78 [2019-03-28 12:40:50,601 INFO L87 Difference]: Start difference. First operand 444 states and 749 transitions. Second operand 19 states. 148.10/100.78 [2019-03-28 12:40:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:40:55,176 INFO L93 Difference]: Finished difference Result 651 states and 1072 transitions. 148.10/100.78 [2019-03-28 12:40:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 148.10/100.78 [2019-03-28 12:40:55,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 148.10/100.78 [2019-03-28 12:40:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 148.10/100.78 [2019-03-28 12:40:55,192 INFO L225 Difference]: With dead ends: 651 148.10/100.78 [2019-03-28 12:40:55,192 INFO L226 Difference]: Without dead ends: 0 148.10/100.78 [2019-03-28 12:40:55,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 148.10/100.78 [2019-03-28 12:40:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 148.10/100.78 [2019-03-28 12:40:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 148.10/100.78 [2019-03-28 12:40:55,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 148.10/100.78 [2019-03-28 12:40:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 148.10/100.78 [2019-03-28 12:40:55,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 148.10/100.78 [2019-03-28 12:40:55,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 148.10/100.78 [2019-03-28 12:40:55,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,678 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 501 DAG size of output: 474 148.10/100.78 [2019-03-28 12:40:56,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:56,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 148.10/100.78 [2019-03-28 12:40:58,817 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 506 DAG size of output: 454 148.10/100.78 [2019-03-28 12:41:14,878 WARN L188 SmtUtils]: Spent 16.06 s on a formula simplification. DAG size of input: 470 DAG size of output: 105 148.10/100.78 [2019-03-28 12:41:46,866 WARN L188 SmtUtils]: Spent 31.98 s on a formula simplification. DAG size of input: 438 DAG size of output: 143 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 33) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 20) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,871 INFO L448 ceAbstractionStarter]: For program point L17-4(line 17) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 22) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,872 INFO L448 ceAbstractionStarter]: For program point L17-6(lines 17 18) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L444 ceAbstractionStarter]: At program point L17-8(lines 17 18) the Hoare annotation is: (let ((.cse46 (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse45 (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (.cse40 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse32 (= 0 ULTIMATE.start_cstrspn_~s~0.offset)) (.cse7 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse8 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse10 (= ULTIMATE.start_cstrspn_~s2.offset 0)) (.cse15 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse17 (= (select |#valid| ULTIMATE.start_cstrspn_~sc1~0.base) 1)) (.cse18 (<= ULTIMATE.start_cstrspn_~sc1~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse19 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= (select |#valid| ULTIMATE.start_cstrspn_~s~0.base) 1)) (.cse5 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse6 (= ULTIMATE.start_main_~length1~0 .cse40)) (.cse34 (<= 1 .cse45)) (.cse9 (<= 1 (select |#length| ULTIMATE.start_cstrspn_~s2.base))) (.cse12 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse16 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse44 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse39 (select .cse46 ULTIMATE.start_cstrspn_~sc1~0.offset))) (let ((.cse38 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset)) (.cse31 (<= (+ ULTIMATE.start_cstrspn_~c~0 1) 0)) (.cse33 (<= (+ .cse39 1) 0)) (.cse21 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse30 (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse41 (select .cse46 (+ .cse44 (- 1)))) (.cse11 (<= 1 ULTIMATE.start_cstrspn_~s~0.offset)) (.cse20 (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) .cse45)) (.cse0 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse1 (and .cse32 .cse7 .cse8 .cse10 .cse15 .cse17 .cse18 .cse19 .cse4 .cse5 .cse6 .cse34 .cse9 .cse12 .cse13 .cse14 .cse16)) (.cse2 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset))))) (let ((.cse3 (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse29 (or (and .cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse19) .cse20 .cse2) (and .cse0 .cse1 .cse2))) (.cse23 (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) .cse44)) (.cse24 (<= 1 ULTIMATE.start_cstrspn_~c~0)) (.cse27 (<= 1 .cse39)) (.cse35 (= ULTIMATE.start_cstrspn_~s2.offset ULTIMATE.start_cstrspn_~s~0.offset)) (.cse36 (= ULTIMATE.start_cstrspn_~s2.base ULTIMATE.start_cstrspn_~s~0.base)) (.cse22 (= .cse41 0)) (.cse37 (let ((.cse42 (and (<= 2 .cse44) .cse30)) (.cse43 (or (not (= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1)) (and (= 1 ULTIMATE.start_main_~length1~0) .cse21)))) (or (and .cse0 (and .cse31 .cse7 .cse8 .cse42 .cse10 .cse11 .cse33 .cse15 .cse17 .cse18 .cse19 .cse4 .cse5 .cse6 .cse9 .cse12 .cse13 .cse14 .cse16 .cse43) .cse20 .cse2) (and .cse0 (and .cse31 .cse32 .cse7 .cse8 .cse42 .cse10 .cse33 .cse15 .cse17 .cse18 .cse19 .cse4 .cse5 .cse6 .cse34 .cse9 .cse12 .cse13 .cse14 .cse16 .cse43) .cse2)))) (.cse25 (not (= .cse41 .cse38))) (.cse26 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse40 (- 1))) 0)) (.cse28 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 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)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~sc1~0.base)))))) (or (and (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse2 .cse3)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse29 .cse21 .cse22 .cse23 .cse24 .cse30 .cse25 .cse26 .cse27 .cse28) (and .cse23 (or (and .cse0 (and .cse31 .cse32 .cse7 .cse8 .cse10 .cse33 .cse15 .cse17 .cse18 .cse19 .cse4 .cse5 .cse6 .cse34 .cse9 .cse12 .cse13 .cse14 .cse16) .cse2 .cse3) (and .cse0 (and .cse31 .cse7 .cse8 .cse10 .cse11 .cse33 .cse15 .cse17 .cse18 .cse19 .cse4 .cse5 .cse6 .cse9 .cse12 .cse13 .cse14 .cse16) .cse20 .cse2 .cse3)) .cse21 .cse25 .cse26 .cse28 .cse22) (and .cse29 .cse21 .cse22 .cse23 .cse24 .cse30 .cse35 .cse26 .cse36 .cse27 .cse28) (and .cse21 .cse22 .cse37 .cse35 .cse26 .cse36 .cse28) (and (= 0 .cse38) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse4 .cse5 (not (= 0 ULTIMATE.start_cstrspn_~c~0)) .cse32 .cse6 .cse34 .cse7 (not (= 0 .cse39)) .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)) .cse17 .cse18 .cse19) (and .cse21 .cse22 .cse37 .cse25 .cse26 .cse28)))))) 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point L17-9(lines 17 18) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,873 INFO L448 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 25 39) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,874 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 21) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,875 INFO L444 ceAbstractionStarter]: At program point L14-4(lines 14 21) the Hoare annotation is: (let ((.cse16 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base))) (let ((.cse21 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ .cse16 (- 1)))) (.cse25 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset)) (.cse1 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse2 (<= 1 .cse16)) (.cse3 (= ULTIMATE.start_main_~length1~0 .cse25)) (.cse4 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse18 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse5 (<= 1 (select |#length| ULTIMATE.start_cstrspn_~s2.base))) (.cse6 (= ULTIMATE.start_cstrspn_~s2.offset 0)) (.cse7 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse10 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse13 (= (select |#valid| ULTIMATE.start_cstrspn_~sc1~0.base) 1)) (.cse14 (<= ULTIMATE.start_cstrspn_~sc1~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse20 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse24 (= .cse21 0)) (.cse19 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ (select |#length| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse9 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse11 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse12 (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse22 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse25 (- 1))) 0)) (.cse23 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 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)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~sc1~0.base)))))) (or (and (= 0 .cse0) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) .cse16) (and (and (let ((.cse17 (= (select |#valid| ULTIMATE.start_cstrspn_~s~0.base) 1))) (or (and .cse17 .cse1 .cse3 .cse18 .cse5 .cse6 (<= 1 ULTIMATE.start_cstrspn_~s~0.offset) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse17 .cse1 (= 0 ULTIMATE.start_cstrspn_~s~0.offset) .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15))) (not (= 0 ULTIMATE.start_cstrspn_~c~0))) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 2) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) .cse19 .cse4 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrspn_~s~0.base) (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset))) (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset)) .cse20 (not (= .cse21 .cse0)) .cse22 .cse23 .cse24) (and (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15) .cse20 .cse24 .cse19 .cse9 .cse11 .cse12 .cse22 .cse23))))) 148.10/100.78 [2019-03-28 12:41:46,875 INFO L448 ceAbstractionStarter]: For program point L14-5(lines 14 21) no Hoare annotation was computed. 148.10/100.78 [2019-03-28 12:41:46,875 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 148.10/100.78 [2019-03-28 12:41:46,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,920 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,920 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,920 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:46,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:46,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:46,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.78 [2019-03-28 12:41:47,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,059 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,059 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,059 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,097 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,098 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,099 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.78 [2019-03-28 12:41:47,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:47,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:47 BasicIcfg 148.10/100.78 [2019-03-28 12:41:47,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 148.10/100.78 [2019-03-28 12:41:47,109 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 148.10/100.78 [2019-03-28 12:41:47,110 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 148.10/100.78 [2019-03-28 12:41:47,113 INFO L276 PluginConnector]: BuchiAutomizer initialized 148.10/100.78 [2019-03-28 12:41:47,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 148.10/100.78 [2019-03-28 12:41:47,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:17" (1/5) ... 148.10/100.78 [2019-03-28 12:41:47,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bc05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:47, skipping insertion in model container 148.10/100.78 [2019-03-28 12:41:47,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 148.10/100.78 [2019-03-28 12:41:47,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:17" (2/5) ... 148.10/100.78 [2019-03-28 12:41:47,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bc05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:47, skipping insertion in model container 148.10/100.78 [2019-03-28 12:41:47,116 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 148.10/100.78 [2019-03-28 12:41:47,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:17" (3/5) ... 148.10/100.78 [2019-03-28 12:41:47,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bc05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:47, skipping insertion in model container 148.10/100.78 [2019-03-28 12:41:47,116 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 148.10/100.78 [2019-03-28 12:41:47,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:18" (4/5) ... 148.10/100.78 [2019-03-28 12:41:47,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bc05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:47, skipping insertion in model container 148.10/100.78 [2019-03-28 12:41:47,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 148.10/100.78 [2019-03-28 12:41:47,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:47" (5/5) ... 148.10/100.78 [2019-03-28 12:41:47,118 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 148.10/100.78 [2019-03-28 12:41:47,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation 148.10/100.78 [2019-03-28 12:41:47,142 INFO L374 BuchiCegarLoop]: Interprodecural is true 148.10/100.78 [2019-03-28 12:41:47,142 INFO L375 BuchiCegarLoop]: Hoare is true 148.10/100.78 [2019-03-28 12:41:47,142 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 148.10/100.78 [2019-03-28 12:41:47,142 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 148.10/100.78 [2019-03-28 12:41:47,142 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 148.10/100.78 [2019-03-28 12:41:47,142 INFO L379 BuchiCegarLoop]: Difference is false 148.10/100.78 [2019-03-28 12:41:47,143 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 148.10/100.78 [2019-03-28 12:41:47,143 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 148.10/100.78 [2019-03-28 12:41:47,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. 148.10/100.78 [2019-03-28 12:41:47,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 148.10/100.78 [2019-03-28 12:41:47,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:47,153 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:47,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,158 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,158 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 148.10/100.78 [2019-03-28 12:41:47,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. 148.10/100.78 [2019-03-28 12:41:47,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 148.10/100.78 [2019-03-28 12:41:47,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:47,160 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:47,160 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,160 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,166 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 23#L28true [122] L28-->L28-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#L28-2true [137] L28-2-->L31-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[] 6#L31-1true [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 16#L36true [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 15#L36-1true [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 9#L14-4true 148.10/100.78 [2019-03-28 12:41:47,166 INFO L796 eck$LassoCheckResult]: Loop: 9#L14-4true [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 14#L14-1true [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 4#L16true [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 7#L17-8true [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 22#L17-1true [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 18#L17-2true [117] L17-2-->L17-6: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_5|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} AuxVars[] AssignedVars[] 31#L17-6true [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 5#L17-9true [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 26#L19true [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 9#L14-4true 148.10/100.78 [2019-03-28 12:41:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:47,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1451558267, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:47,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 148.10/100.78 [2019-03-28 12:41:47,208 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.78 [2019-03-28 12:41:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.78 [2019-03-28 12:41:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.78 [2019-03-28 12:41:47,210 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. 148.10/100.78 [2019-03-28 12:41:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:47,305 INFO L93 Difference]: Finished difference Result 37 states and 72 transitions. 148.10/100.78 [2019-03-28 12:41:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.78 [2019-03-28 12:41:47,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 72 transitions. 148.10/100.78 [2019-03-28 12:41:47,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 148.10/100.78 [2019-03-28 12:41:47,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 148.10/100.78 [2019-03-28 12:41:47,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 148.10/100.78 [2019-03-28 12:41:47,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.78 [2019-03-28 12:41:47,312 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 148.10/100.78 [2019-03-28 12:41:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 148.10/100.78 [2019-03-28 12:41:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,315 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,315 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,316 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 148.10/100.78 [2019-03-28 12:41:47,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 37 transitions. 148.10/100.78 [2019-03-28 12:41:47,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 148.10/100.78 [2019-03-28 12:41:47,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:47,317 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:47,317 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,317 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,318 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 89#L28 [122] L28-->L28-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] 83#L28-2 [137] L28-2-->L31-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[] 84#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 93#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 99#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 92#L14-4 148.10/100.78 [2019-03-28 12:41:47,318 INFO L796 eck$LassoCheckResult]: Loop: 92#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 94#L14-1 [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 87#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 88#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 85#L17-1 [211] L17-1-->L17-2: Formula: (and (not |v_ULTIMATE.start_cstrspn_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 86#L17-2 [117] L17-2-->L17-6: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_5|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} AuxVars[] AssignedVars[] 98#L17-6 [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 90#L17-9 [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 91#L19 [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 92#L14-4 148.10/100.78 [2019-03-28 12:41:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 2 times 148.10/100.78 [2019-03-28 12:41:47,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1453405309, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:47,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:47,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:47,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 148.10/100.78 [2019-03-28 12:41:47,387 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.78 [2019-03-28 12:41:47,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 148.10/100.78 [2019-03-28 12:41:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 148.10/100.78 [2019-03-28 12:41:47,388 INFO L87 Difference]: Start difference. First operand 19 states and 37 transitions. cyclomatic complexity: 19 Second operand 8 states. 148.10/100.78 [2019-03-28 12:41:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:47,639 INFO L93 Difference]: Finished difference Result 28 states and 55 transitions. 148.10/100.78 [2019-03-28 12:41:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.78 [2019-03-28 12:41:47,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 55 transitions. 148.10/100.78 [2019-03-28 12:41:47,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 148.10/100.78 [2019-03-28 12:41:47,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 53 transitions. 148.10/100.78 [2019-03-28 12:41:47,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 148.10/100.78 [2019-03-28 12:41:47,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 148.10/100.78 [2019-03-28 12:41:47,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 53 transitions. 148.10/100.78 [2019-03-28 12:41:47,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.78 [2019-03-28 12:41:47,642 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 53 transitions. 148.10/100.78 [2019-03-28 12:41:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 53 transitions. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 47 transitions. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 47 transitions. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 47 transitions. 148.10/100.78 [2019-03-28 12:41:47,643 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 148.10/100.78 [2019-03-28 12:41:47,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 47 transitions. 148.10/100.78 [2019-03-28 12:41:47,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 148.10/100.78 [2019-03-28 12:41:47,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:47,644 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:47,645 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,645 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,645 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 160#L28 [122] L28-->L28-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] 154#L28-2 [137] L28-2-->L31-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[] 155#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 164#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 168#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 163#L14-4 148.10/100.78 [2019-03-28 12:41:47,646 INFO L796 eck$LassoCheckResult]: Loop: 163#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 165#L14-1 [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 156#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 157#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 158#L17-1 [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 159#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 171#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 170#L17-4 [230] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and (= (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrspn_#t~mem4_3|) (not |v_ULTIMATE.start_cstrspn_#t~short5_4|) (> .cse0 127))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 169#L17-6 [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 161#L17-9 [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 162#L19 [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 163#L14-4 148.10/100.78 [2019-03-28 12:41:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 3 times 148.10/100.78 [2019-03-28 12:41:47,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash -937778181, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:47,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:47,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:47,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:47,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 148.10/100.78 [2019-03-28 12:41:47,711 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.78 [2019-03-28 12:41:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 148.10/100.78 [2019-03-28 12:41:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 148.10/100.78 [2019-03-28 12:41:47,711 INFO L87 Difference]: Start difference. First operand 21 states and 47 transitions. cyclomatic complexity: 27 Second operand 8 states. 148.10/100.78 [2019-03-28 12:41:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:47,990 INFO L93 Difference]: Finished difference Result 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.78 [2019-03-28 12:41:47,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:47,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 148.10/100.78 [2019-03-28 12:41:47,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 112 transitions. 148.10/100.78 [2019-03-28 12:41:47,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 148.10/100.78 [2019-03-28 12:41:47,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 148.10/100.78 [2019-03-28 12:41:47,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 112 transitions. 148.10/100.78 [2019-03-28 12:41:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.78 [2019-03-28 12:41:47,994 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 112 transitions. 148.10/100.78 [2019-03-28 12:41:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 112 transitions. 148.10/100.78 [2019-03-28 12:41:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. 148.10/100.78 [2019-03-28 12:41:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 148.10/100.78 [2019-03-28 12:41:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 79 transitions. 148.10/100.78 [2019-03-28 12:41:47,996 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 79 transitions. 148.10/100.78 [2019-03-28 12:41:47,996 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 79 transitions. 148.10/100.78 [2019-03-28 12:41:47,996 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 148.10/100.78 [2019-03-28 12:41:47,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 79 transitions. 148.10/100.78 [2019-03-28 12:41:47,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 148.10/100.78 [2019-03-28 12:41:47,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:47,997 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:47,998 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,998 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:47,998 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 252#L28 [122] L28-->L28-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] 245#L28-2 [137] L28-2-->L31-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[] 246#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 256#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 264#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 255#L14-4 148.10/100.78 [2019-03-28 12:41:47,999 INFO L796 eck$LassoCheckResult]: Loop: 255#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 258#L14-1 [178] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (< 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 247#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 248#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 257#L17-1 [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 268#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 267#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 266#L17-4 [230] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and (= (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrspn_#t~mem4_3|) (not |v_ULTIMATE.start_cstrspn_#t~short5_4|) (> .cse0 127))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 265#L17-6 [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 253#L17-9 [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 254#L19 [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 255#L14-4 148.10/100.78 [2019-03-28 12:41:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 4 times 148.10/100.78 [2019-03-28 12:41:47,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:48,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:48,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1134291686, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:48,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:48,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:48,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:48,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 148.10/100.78 [2019-03-28 12:41:48,060 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.78 [2019-03-28 12:41:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 148.10/100.78 [2019-03-28 12:41:48,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 148.10/100.78 [2019-03-28 12:41:48,061 INFO L87 Difference]: Start difference. First operand 33 states and 79 transitions. cyclomatic complexity: 47 Second operand 5 states. 148.10/100.78 [2019-03-28 12:41:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:48,252 INFO L93 Difference]: Finished difference Result 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 148.10/100.78 [2019-03-28 12:41:48,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 148.10/100.78 [2019-03-28 12:41:48,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 148.10/100.78 [2019-03-28 12:41:48,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 148.10/100.78 [2019-03-28 12:41:48,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.78 [2019-03-28 12:41:48,255 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 104 transitions. 148.10/100.78 [2019-03-28 12:41:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. 148.10/100.78 [2019-03-28 12:41:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 148.10/100.78 [2019-03-28 12:41:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 87 transitions. 148.10/100.78 [2019-03-28 12:41:48,258 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 87 transitions. 148.10/100.78 [2019-03-28 12:41:48,258 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 87 transitions. 148.10/100.78 [2019-03-28 12:41:48,258 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 148.10/100.78 [2019-03-28 12:41:48,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 87 transitions. 148.10/100.78 [2019-03-28 12:41:48,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 148.10/100.78 [2019-03-28 12:41:48,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:48,259 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:48,259 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:48,259 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:48,260 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 348#L28 [122] L28-->L28-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] 341#L28-2 [137] L28-2-->L31-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[] 342#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 352#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 360#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 351#L14-4 148.10/100.78 [2019-03-28 12:41:48,260 INFO L796 eck$LassoCheckResult]: Loop: 351#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 354#L14-1 [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 357#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 370#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 345#L17-1 [210] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (> 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 346#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 374#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 372#L17-4 [230] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and (= (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrspn_#t~mem4_3|) (not |v_ULTIMATE.start_cstrspn_#t~short5_4|) (> .cse0 127))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 371#L17-6 [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 349#L17-9 [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 350#L19 [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 351#L14-4 148.10/100.78 [2019-03-28 12:41:48,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:48,261 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 5 times 148.10/100.78 [2019-03-28 12:41:48,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:48,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -50274500, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:48,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:48,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:48,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash -824374825, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:48,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:48,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:48,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:48,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 148.10/100.78 [2019-03-28 12:41:48,533 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 148.10/100.78 [2019-03-28 12:41:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 148.10/100.78 [2019-03-28 12:41:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 148.10/100.78 [2019-03-28 12:41:48,576 INFO L87 Difference]: Start difference. First operand 36 states and 87 transitions. cyclomatic complexity: 52 Second operand 10 states. 148.10/100.78 [2019-03-28 12:41:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:49,051 INFO L93 Difference]: Finished difference Result 78 states and 178 transitions. 148.10/100.78 [2019-03-28 12:41:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 148.10/100.78 [2019-03-28 12:41:49,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 178 transitions. 148.10/100.78 [2019-03-28 12:41:49,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 148.10/100.78 [2019-03-28 12:41:49,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 76 states and 175 transitions. 148.10/100.78 [2019-03-28 12:41:49,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 148.10/100.78 [2019-03-28 12:41:49,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 148.10/100.78 [2019-03-28 12:41:49,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 175 transitions. 148.10/100.78 [2019-03-28 12:41:49,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.78 [2019-03-28 12:41:49,054 INFO L706 BuchiCegarLoop]: Abstraction has 76 states and 175 transitions. 148.10/100.78 [2019-03-28 12:41:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 175 transitions. 148.10/100.78 [2019-03-28 12:41:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. 148.10/100.78 [2019-03-28 12:41:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. 148.10/100.78 [2019-03-28 12:41:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:49,057 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:49,057 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:49,057 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 148.10/100.78 [2019-03-28 12:41:49,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 114 transitions. 148.10/100.78 [2019-03-28 12:41:49,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 148.10/100.78 [2019-03-28 12:41:49,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:49,058 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:49,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:49,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:49,059 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 488#L28 [136] L28-->L28-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[] 482#L28-2 [137] L28-2-->L31-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[] 483#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 493#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 519#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 492#L14-4 148.10/100.78 [2019-03-28 12:41:49,060 INFO L796 eck$LassoCheckResult]: Loop: 492#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 514#L14-1 [178] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (< 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 513#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 512#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 509#L17-1 [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 508#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 507#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 506#L17-4 [234] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and (not |v_ULTIMATE.start_cstrspn_#t~short5_4|) (<= .cse0 127) (= .cse0 |v_ULTIMATE.start_cstrspn_#t~mem4_3|))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 505#L17-6 [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 490#L17-9 [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 491#L19 [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 492#L14-4 148.10/100.78 [2019-03-28 12:41:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash -730222252, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:49,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:49,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1134172522, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:49,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash -465816733, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:49,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:49,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:49,226 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 148.10/100.78 [2019-03-28 12:41:49,487 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 148.10/100.78 [2019-03-28 12:41:49,618 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 148.10/100.78 [2019-03-28 12:41:49,632 INFO L216 LassoAnalysis]: Preferences: 148.10/100.78 [2019-03-28 12:41:49,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 148.10/100.78 [2019-03-28 12:41:49,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 148.10/100.78 [2019-03-28 12:41:49,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 148.10/100.78 [2019-03-28 12:41:49,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false 148.10/100.78 [2019-03-28 12:41:49,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 148.10/100.78 [2019-03-28 12:41:49,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 148.10/100.78 [2019-03-28 12:41:49,634 INFO L130 ssoRankerPreferences]: Path of dumped script: 148.10/100.78 [2019-03-28 12:41:49,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 148.10/100.78 [2019-03-28 12:41:49,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 148.10/100.78 [2019-03-28 12:41:49,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 148.10/100.78 [2019-03-28 12:41:49,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:49,990 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 148.10/100.78 [2019-03-28 12:41:50,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.78 [2019-03-28 12:41:50,508 INFO L300 LassoAnalysis]: Preprocessing complete. 148.10/100.78 [2019-03-28 12:41:50,514 INFO L497 LassoAnalysis]: Using template 'affine'. 148.10/100.78 [2019-03-28 12:41:50,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.78 [2019-03-28 12:41:50,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.78 [2019-03-28 12:41:50,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.78 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.78 Number of strict supporting invariants: 0 148.10/100.78 Number of non-strict supporting invariants: 1 148.10/100.78 Consider only non-deceasing supporting invariants: true 148.10/100.78 Simplify termination arguments: true 148.10/100.78 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.78 [2019-03-28 12:41:50,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.78 [2019-03-28 12:41:50,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.78 [2019-03-28 12:41:50,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.78 [2019-03-28 12:41:50,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.78 [2019-03-28 12:41:50,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.78 [2019-03-28 12:41:50,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.78 [2019-03-28 12:41:50,564 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 148.10/100.78 [2019-03-28 12:41:50,577 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 148.10/100.78 [2019-03-28 12:41:50,577 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 148.10/100.78 [2019-03-28 12:41:50,580 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 148.10/100.78 [2019-03-28 12:41:50,581 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 148.10/100.78 [2019-03-28 12:41:50,581 INFO L518 LassoAnalysis]: Proved termination. 148.10/100.78 [2019-03-28 12:41:50,582 INFO L520 LassoAnalysis]: Termination argument consisting of: 148.10/100.78 Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 148.10/100.78 Supporting invariants [] 148.10/100.78 [2019-03-28 12:41:50,611 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed 148.10/100.78 [2019-03-28 12:41:50,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.78 [2019-03-28 12:41:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:50,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.78 [2019-03-28 12:41:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.78 [2019-03-28 12:41:50,872 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 148.10/100.78 [2019-03-28 12:41:50,876 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 148.10/100.78 [2019-03-28 12:41:50,877 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 50 states and 114 transitions. cyclomatic complexity: 66 Second operand 4 states. 148.10/100.78 [2019-03-28 12:41:51,037 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 50 states and 114 transitions. cyclomatic complexity: 66. Second operand 4 states. Result 89 states and 210 transitions. Complement of second has 5 states. 148.10/100.78 [2019-03-28 12:41:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 148.10/100.78 [2019-03-28 12:41:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 148.10/100.78 [2019-03-28 12:41:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. 148.10/100.78 [2019-03-28 12:41:51,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 6 letters. Loop has 11 letters. 148.10/100.78 [2019-03-28 12:41:51,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.78 [2019-03-28 12:41:51,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 17 letters. Loop has 11 letters. 148.10/100.78 [2019-03-28 12:41:51,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.78 [2019-03-28 12:41:51,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 6 letters. Loop has 22 letters. 148.10/100.78 [2019-03-28 12:41:51,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.78 [2019-03-28 12:41:51,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 210 transitions. 148.10/100.78 [2019-03-28 12:41:51,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 148.10/100.78 [2019-03-28 12:41:51,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 78 states and 188 transitions. 148.10/100.78 [2019-03-28 12:41:51,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 148.10/100.78 [2019-03-28 12:41:51,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 148.10/100.78 [2019-03-28 12:41:51,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 188 transitions. 148.10/100.78 [2019-03-28 12:41:51,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 148.10/100.78 [2019-03-28 12:41:51,051 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 188 transitions. 148.10/100.78 [2019-03-28 12:41:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 188 transitions. 148.10/100.78 [2019-03-28 12:41:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. 148.10/100.78 [2019-03-28 12:41:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. 148.10/100.78 [2019-03-28 12:41:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 148 transitions. 148.10/100.78 [2019-03-28 12:41:51,053 INFO L729 BuchiCegarLoop]: Abstraction has 63 states and 148 transitions. 148.10/100.78 [2019-03-28 12:41:51,053 INFO L609 BuchiCegarLoop]: Abstraction has 63 states and 148 transitions. 148.10/100.78 [2019-03-28 12:41:51,054 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 148.10/100.78 [2019-03-28 12:41:51,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 148 transitions. 148.10/100.78 [2019-03-28 12:41:51,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 148.10/100.78 [2019-03-28 12:41:51,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.78 [2019-03-28 12:41:51,055 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.78 [2019-03-28 12:41:51,055 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:51,055 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 148.10/100.78 [2019-03-28 12:41:51,056 INFO L794 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 876#L28 [136] L28-->L28-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[] 877#L28-2 [137] L28-2-->L31-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[] 881#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 882#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 901#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 903#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 888#L14-1 [178] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (< 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 866#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 867#L17-8 148.10/100.78 [2019-03-28 12:41:51,056 INFO L796 eck$LassoCheckResult]: Loop: 867#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 870#L17-1 [211] L17-1-->L17-2: Formula: (and (not |v_ULTIMATE.start_cstrspn_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 872#L17-2 [117] L17-2-->L17-6: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_5|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} AuxVars[] AssignedVars[] 890#L17-6 [130] L17-6-->L17-8: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_11 v_ULTIMATE.start_cstrspn_~s~0.base_10) |v_ULTIMATE.start_cstrspn_#t~short5_9| (= v_ULTIMATE.start_cstrspn_~s~0.offset_8 (+ v_ULTIMATE.start_cstrspn_~s~0.offset_9 1))) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_9, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_11} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_8|, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_2|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_2|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_8, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base] 867#L17-8 148.10/100.78 [2019-03-28 12:41:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash -41651311, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:51,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.78 [2019-03-28 12:41:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.78 [2019-03-28 12:41:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash 3989985, now seen corresponding path program 1 times 148.10/100.78 [2019-03-28 12:41:51,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.78 [2019-03-28 12:41:51,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.78 [2019-03-28 12:41:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.78 [2019-03-28 12:41:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.78 [2019-03-28 12:41:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.78 [2019-03-28 12:41:51,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.78 [2019-03-28 12:41:51,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 148.10/100.78 [2019-03-28 12:41:51,088 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.78 [2019-03-28 12:41:51,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 148.10/100.78 [2019-03-28 12:41:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 148.10/100.78 [2019-03-28 12:41:51,089 INFO L87 Difference]: Start difference. First operand 63 states and 148 transitions. cyclomatic complexity: 88 Second operand 3 states. 148.10/100.78 [2019-03-28 12:41:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.78 [2019-03-28 12:41:51,147 INFO L93 Difference]: Finished difference Result 65 states and 133 transitions. 148.10/100.78 [2019-03-28 12:41:51,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 148.10/100.79 [2019-03-28 12:41:51,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 133 transitions. 148.10/100.79 [2019-03-28 12:41:51,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 148.10/100.79 [2019-03-28 12:41:51,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 57 states and 120 transitions. 148.10/100.79 [2019-03-28 12:41:51,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 148.10/100.79 [2019-03-28 12:41:51,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 148.10/100.79 [2019-03-28 12:41:51,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 120 transitions. 148.10/100.79 [2019-03-28 12:41:51,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 148.10/100.79 [2019-03-28 12:41:51,153 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 120 transitions. 148.10/100.79 [2019-03-28 12:41:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 120 transitions. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 110 transitions. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 110 transitions. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 110 transitions. 148.10/100.79 [2019-03-28 12:41:51,155 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 148.10/100.79 [2019-03-28 12:41:51,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 110 transitions. 148.10/100.79 [2019-03-28 12:41:51,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 148.10/100.79 [2019-03-28 12:41:51,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.79 [2019-03-28 12:41:51,156 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.79 [2019-03-28 12:41:51,157 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.79 [2019-03-28 12:41:51,157 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 148.10/100.79 [2019-03-28 12:41:51,158 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 1008#L28 [136] L28-->L28-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[] 998#L28-2 [137] L28-2-->L31-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[] 999#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 1034#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 1033#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 1032#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 1019#L14-1 [178] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (< 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 1000#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 1001#L17-8 148.10/100.79 [2019-03-28 12:41:51,158 INFO L796 eck$LassoCheckResult]: Loop: 1001#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 1004#L17-1 [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 994#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 995#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 1029#L17-4 [228] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and (> .cse0 |v_ULTIMATE.start_cstrspn_#t~mem4_3|) |v_ULTIMATE.start_cstrspn_#t~short5_4| (> (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrspn_#t~mem4_3|))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 1021#L17-6 [130] L17-6-->L17-8: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_11 v_ULTIMATE.start_cstrspn_~s~0.base_10) |v_ULTIMATE.start_cstrspn_#t~short5_9| (= v_ULTIMATE.start_cstrspn_~s~0.offset_8 (+ v_ULTIMATE.start_cstrspn_~s~0.offset_9 1))) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_9, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_11} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_8|, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_2|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_2|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_8, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base] 1001#L17-8 148.10/100.79 [2019-03-28 12:41:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -41651311, now seen corresponding path program 2 times 148.10/100.79 [2019-03-28 12:41:51,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.79 [2019-03-28 12:41:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.79 [2019-03-28 12:41:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -462458463, now seen corresponding path program 1 times 148.10/100.79 [2019-03-28 12:41:51,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.79 [2019-03-28 12:41:51,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.79 [2019-03-28 12:41:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.79 [2019-03-28 12:41:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.79 [2019-03-28 12:41:51,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 148.10/100.79 [2019-03-28 12:41:51,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 148.10/100.79 [2019-03-28 12:41:51,197 INFO L811 eck$LassoCheckResult]: loop already infeasible 148.10/100.79 [2019-03-28 12:41:51,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 148.10/100.79 [2019-03-28 12:41:51,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 148.10/100.79 [2019-03-28 12:41:51,197 INFO L87 Difference]: Start difference. First operand 53 states and 110 transitions. cyclomatic complexity: 60 Second operand 5 states. 148.10/100.79 [2019-03-28 12:41:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 148.10/100.79 [2019-03-28 12:41:51,330 INFO L93 Difference]: Finished difference Result 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 148.10/100.79 [2019-03-28 12:41:51,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 148.10/100.79 [2019-03-28 12:41:51,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 148.10/100.79 [2019-03-28 12:41:51,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 148.10/100.79 [2019-03-28 12:41:51,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 148.10/100.79 [2019-03-28 12:41:51,337 INFO L706 BuchiCegarLoop]: Abstraction has 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 136 transitions. 148.10/100.79 [2019-03-28 12:41:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. 148.10/100.79 [2019-03-28 12:41:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 148.10/100.79 [2019-03-28 12:41:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 119 transitions. 148.10/100.79 [2019-03-28 12:41:51,339 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 119 transitions. 148.10/100.79 [2019-03-28 12:41:51,339 INFO L609 BuchiCegarLoop]: Abstraction has 59 states and 119 transitions. 148.10/100.79 [2019-03-28 12:41:51,339 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 148.10/100.79 [2019-03-28 12:41:51,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 119 transitions. 148.10/100.79 [2019-03-28 12:41:51,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 148.10/100.79 [2019-03-28 12:41:51,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 148.10/100.79 [2019-03-28 12:41:51,340 INFO L119 BuchiIsEmpty]: Starting construction of run 148.10/100.79 [2019-03-28 12:41:51,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 148.10/100.79 [2019-03-28 12:41:51,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 148.10/100.79 [2019-03-28 12:41:51,341 INFO L794 eck$LassoCheckResult]: Stem: 1162#ULTIMATE.startENTRY [239] ULTIMATE.startENTRY-->L28: 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~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 1150#L28 [136] L28-->L28-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[] 1138#L28-2 [137] L28-2-->L31-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[] 1139#L31-1 [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1)))) 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_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, 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, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, 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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 1172#L36 [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |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))) (<= .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_6|, #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_6|, #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] 1173#L36-1 [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= (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_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4))) InVars {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_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, 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_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 1175#L14-4 [102] L14-4-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 1161#L14-1 [178] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (< 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 1140#L16 [241] L16-->L17-8: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 1141#L17-8 148.10/100.79 [2019-03-28 12:41:51,341 INFO L796 eck$LassoCheckResult]: Loop: 1141#L17-8 [96] L17-8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4) 1) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 1144#L17-1 [209] L17-1-->L17-2: Formula: (and |v_ULTIMATE.start_cstrspn_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 1145#L17-2 [116] L17-2-->L17-3: Formula: |v_ULTIMATE.start_cstrspn_#t~short5_3| InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_3|} AuxVars[] AssignedVars[] 1170#L17-3 [133] L17-3-->L17-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_6 1) (select |v_#length_14| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (= |v_ULTIMATE.start_cstrspn_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrspn_~s~0.base_7) v_ULTIMATE.start_cstrspn_~s~0.offset_6)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_cstrspn_~s~0.base_7)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_6, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_2|, #length=|v_#length_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem4] 1171#L17-4 [229] L17-4-->L17-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrspn_~c~0_4 256))) (and |v_ULTIMATE.start_cstrspn_#t~short5_4| (< (+ .cse0 (- 256)) |v_ULTIMATE.start_cstrspn_#t~mem4_3|) (< .cse0 |v_ULTIMATE.start_cstrspn_#t~mem4_3|))) InVars {ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_4|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_3|, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 1163#L17-6 [130] L17-6-->L17-8: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_11 v_ULTIMATE.start_cstrspn_~s~0.base_10) |v_ULTIMATE.start_cstrspn_#t~short5_9| (= v_ULTIMATE.start_cstrspn_~s~0.offset_8 (+ v_ULTIMATE.start_cstrspn_~s~0.offset_9 1))) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_9, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_11} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_8|, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_2|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_2|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_8, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_5|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_5|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base] 1141#L17-8 148.10/100.79 [2019-03-28 12:41:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash -41651311, now seen corresponding path program 3 times 148.10/100.79 [2019-03-28 12:41:51,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.79 [2019-03-28 12:41:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.79 [2019-03-28 12:41:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -462458432, now seen corresponding path program 1 times 148.10/100.79 [2019-03-28 12:41:51,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.79 [2019-03-28 12:41:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.79 [2019-03-28 12:41:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash -585959088, now seen corresponding path program 1 times 148.10/100.79 [2019-03-28 12:41:51,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 148.10/100.79 [2019-03-28 12:41:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 148.10/100.79 [2019-03-28 12:41:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 148.10/100.79 [2019-03-28 12:41:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 148.10/100.79 [2019-03-28 12:41:51,831 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 148.10/100.79 [2019-03-28 12:41:51,962 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 90 148.10/100.79 [2019-03-28 12:41:51,964 INFO L216 LassoAnalysis]: Preferences: 148.10/100.79 [2019-03-28 12:41:51,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 148.10/100.79 [2019-03-28 12:41:51,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 148.10/100.79 [2019-03-28 12:41:51,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 148.10/100.79 [2019-03-28 12:41:51,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false 148.10/100.79 [2019-03-28 12:41:51,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 148.10/100.79 [2019-03-28 12:41:51,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 148.10/100.79 [2019-03-28 12:41:51,980 INFO L130 ssoRankerPreferences]: Path of dumped script: 148.10/100.79 [2019-03-28 12:41:51,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 148.10/100.79 [2019-03-28 12:41:51,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 148.10/100.79 [2019-03-28 12:41:51,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 148.10/100.79 [2019-03-28 12:41:51,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:51,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,298 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 148.10/100.79 [2019-03-28 12:41:52,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 148.10/100.79 [2019-03-28 12:41:52,585 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 148.10/100.79 [2019-03-28 12:41:52,781 INFO L300 LassoAnalysis]: Preprocessing complete. 148.10/100.79 [2019-03-28 12:41:52,781 INFO L497 LassoAnalysis]: Using template 'affine'. 148.10/100.79 [2019-03-28 12:41:52,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 148.10/100.79 [2019-03-28 12:41:52,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 148.10/100.79 [2019-03-28 12:41:52,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 148.10/100.79 Termination analysis: LINEAR_WITH_GUESSES 148.10/100.79 Number of strict supporting invariants: 0 148.10/100.79 Number of non-strict supporting invariants: 1 148.10/100.79 Consider only non-deceasing supporting invariants: true 148.10/100.79 Simplify termination arguments: true 148.10/100.79 Simplify supporting invariants: trueOverapproximate stem: false 148.10/100.79 [2019-03-28 12:41:52,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 148.10/100.79 [2019-03-28 12:41:52,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 148.10/100.79 [2019-03-28 12:41:52,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 148.10/100.79 [2019-03-28 12:41:52,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 148.10/100.79 [2019-03-28 12:41:52,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 148.10/100.79 [2019-03-28 12:41:52,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 148.10/100.79 [2019-03-28 12:41:52,876 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 148.10/100.79 [2019-03-28 12:41:52,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 148.10/100.79 [2019-03-28 12:41:52,884 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. 148.10/100.79 [2019-03-28 12:41:52,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 148.10/100.79 [2019-03-28 12:41:52,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 148.10/100.79 [2019-03-28 12:41:52,885 INFO L518 LassoAnalysis]: Proved termination. 148.10/100.79 [2019-03-28 12:41:52,885 INFO L520 LassoAnalysis]: Termination argument consisting of: 148.10/100.79 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset 148.10/100.79 Supporting invariants [] 148.10/100.79 [2019-03-28 12:41:52,926 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed 148.10/100.79 [2019-03-28 12:41:52,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.79 [2019-03-28 12:41:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 148.10/100.79 [2019-03-28 12:41:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.79 [2019-03-28 12:41:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core 148.10/100.79 [2019-03-28 12:41:52,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.79 [2019-03-28 12:41:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.79 [2019-03-28 12:41:53,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.79 [2019-03-28 12:41:53,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.79 [2019-03-28 12:41:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 148.10/100.79 [2019-03-28 12:41:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 148.10/100.79 [2019-03-28 12:41:53,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 148.10/100.79 [2019-03-28 12:41:53,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 148.10/100.79 [2019-03-28 12:41:53,162 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 148.10/100.79 [2019-03-28 12:41:53,163 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates 148.10/100.79 [2019-03-28 12:41:53,163 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 59 states and 119 transitions. cyclomatic complexity: 63 Second operand 6 states. 148.10/100.79 [2019-03-28 12:41:53,362 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 59 states and 119 transitions. cyclomatic complexity: 63. Second operand 6 states. Result 101 states and 210 transitions. Complement of second has 7 states. 148.10/100.79 [2019-03-28 12:41:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states 148.10/100.79 [2019-03-28 12:41:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 148.10/100.79 [2019-03-28 12:41:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. 148.10/100.79 [2019-03-28 12:41:53,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 9 letters. Loop has 6 letters. 148.10/100.79 [2019-03-28 12:41:53,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.79 [2019-03-28 12:41:53,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 15 letters. Loop has 6 letters. 148.10/100.79 [2019-03-28 12:41:53,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.79 [2019-03-28 12:41:53,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 9 letters. Loop has 12 letters. 148.10/100.79 [2019-03-28 12:41:53,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. 148.10/100.79 [2019-03-28 12:41:53,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 210 transitions. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 148.10/100.79 [2019-03-28 12:41:53,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 148.10/100.79 [2019-03-28 12:41:53,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 148.10/100.79 [2019-03-28 12:41:53,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,370 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,371 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 148.10/100.79 [2019-03-28 12:41:53,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 148.10/100.79 [2019-03-28 12:41:53,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 148.10/100.79 [2019-03-28 12:41:53,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 148.10/100.79 [2019-03-28 12:41:53,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:53 BasicIcfg 148.10/100.79 [2019-03-28 12:41:53,377 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 148.10/100.79 [2019-03-28 12:41:53,377 INFO L168 Benchmark]: Toolchain (without parser) took 96200.92 ms. Allocated memory was 649.6 MB in the beginning and 1.3 GB in the end (delta: 688.9 MB). Free memory was 564.9 MB in the beginning and 549.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 704.8 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,378 INFO L168 Benchmark]: CDTParser took 0.17 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. 148.10/100.79 [2019-03-28 12:41:53,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.23 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 564.9 MB in the beginning and 639.3 MB in the end (delta: -74.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.88 ms. Allocated memory is still 674.8 MB. Free memory was 639.3 MB in the beginning and 636.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,379 INFO L168 Benchmark]: Boogie Preprocessor took 31.48 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 635.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,380 INFO L168 Benchmark]: RCFGBuilder took 355.57 ms. Allocated memory is still 674.8 MB. Free memory was 635.2 MB in the beginning and 609.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,380 INFO L168 Benchmark]: BlockEncodingV2 took 157.55 ms. Allocated memory is still 674.8 MB. Free memory was 609.0 MB in the beginning and 596.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,381 INFO L168 Benchmark]: TraceAbstraction took 89017.23 ms. Allocated memory was 674.8 MB in the beginning and 1.3 GB in the end (delta: 654.3 MB). Free memory was 596.9 MB in the beginning and 818.7 MB in the end (delta: -221.8 MB). Peak memory consumption was 836.0 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,381 INFO L168 Benchmark]: BuchiAutomizer took 6267.62 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.4 MB). Free memory was 818.7 MB in the beginning and 549.0 MB in the end (delta: 269.7 MB). Peak memory consumption was 279.1 MB. Max. memory is 50.3 GB. 148.10/100.79 [2019-03-28 12:41:53,385 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 148.10/100.79 --- Results --- 148.10/100.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 148.10/100.79 - StatisticsResult: Initial Icfg 148.10/100.79 43 locations, 50 edges 148.10/100.79 - StatisticsResult: Encoded RCFG 148.10/100.79 35 locations, 72 edges 148.10/100.79 * Results from de.uni_freiburg.informatik.ultimate.core: 148.10/100.79 - StatisticsResult: Toolchain Benchmarks 148.10/100.79 Benchmark results are: 148.10/100.79 * CDTParser took 0.17 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. 148.10/100.79 * CACSL2BoogieTranslator took 321.23 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 564.9 MB in the beginning and 639.3 MB in the end (delta: -74.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 148.10/100.79 * Boogie Procedure Inliner took 44.88 ms. Allocated memory is still 674.8 MB. Free memory was 639.3 MB in the beginning and 636.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 148.10/100.79 * Boogie Preprocessor took 31.48 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 635.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 148.10/100.79 * RCFGBuilder took 355.57 ms. Allocated memory is still 674.8 MB. Free memory was 635.2 MB in the beginning and 609.0 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 148.10/100.79 * BlockEncodingV2 took 157.55 ms. Allocated memory is still 674.8 MB. Free memory was 609.0 MB in the beginning and 596.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 148.10/100.79 * TraceAbstraction took 89017.23 ms. Allocated memory was 674.8 MB in the beginning and 1.3 GB in the end (delta: 654.3 MB). Free memory was 596.9 MB in the beginning and 818.7 MB in the end (delta: -221.8 MB). Peak memory consumption was 836.0 MB. Max. memory is 50.3 GB. 148.10/100.79 * BuchiAutomizer took 6267.62 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.4 MB). Free memory was 818.7 MB in the beginning and 549.0 MB in the end (delta: 269.7 MB). Peak memory consumption was 279.1 MB. Max. memory is 50.3 GB. 148.10/100.79 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #memory_int 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 - GenericResult: Unfinished Backtranslation 148.10/100.79 unknown boogie variable #length 148.10/100.79 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 148.10/100.79 - PositiveResult [Line: 22]: pointer arithmetic is always legal 148.10/100.79 For all program executions holds that pointer arithmetic is always legal at this location 148.10/100.79 - PositiveResult [Line: 17]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 17]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 16]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 16]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 14]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 14]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 37]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 37]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 19]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 19]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 36]: pointer dereference always succeeds 148.10/100.79 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.79 - PositiveResult [Line: 36]: pointer dereference always succeeds 148.10/100.80 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 148.10/100.80 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 148.10/100.80 For all program executions holds that pointer dereference always succeeds at this location 148.10/100.80 - PositiveResult [Line: 20]: pointer arithmetic is always legal 148.10/100.80 For all program executions holds that pointer arithmetic is always legal at this location 148.10/100.80 - AllSpecificationsHoldResult: All specifications hold 148.10/100.80 16 specifications checked. All of them hold 148.10/100.80 - InvariantResult [Line: 14]: Loop Invariant 148.10/100.80 [2019-03-28 12:41:53,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,408 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,409 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,410 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,410 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 Derived loop invariant: (((((((((((((((((0 == unknown-#memory_int-unknown[s2][s2] && 1 == length2 + nondetString2) && s1 <= sc1) && 1 <= unknown-#length-unknown[sc1]) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && 0 == sc1) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) || ((((((sc1 + 1 <= unknown-#length-unknown[sc1] && ((((((((((((((((((((\valid[s] == 1 && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= s) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) || ((((((((((((((\valid[s] == 1 && s1 <= sc1) && 0 == s) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2])) && !(0 == c)) && s + 2 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && unknown-#length-unknown[nondetString2] == length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 <= sc1) && !(nondetString1 == nondetString2)) && !(unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == unknown-#memory_int-unknown[s2][s2])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0)) || ((((((((((((((((((((s1 <= sc1 && 1 <= unknown-#length-unknown[sc1]) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && nondetString1 == 0) && nondetString2 == 0) && 0 == sc1) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) 148.10/100.80 - InvariantResult [Line: 17]: Loop Invariant 148.10/100.80 [2019-03-28 12:41:53,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,472 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,473 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 148.10/100.80 [2019-03-28 12:41:53,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,556 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,559 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,559 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,559 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,560 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 148.10/100.80 [2019-03-28 12:41:53,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 148.10/100.80 Derived loop invariant: ((((((((((((((((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((0 == s && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && s2 == 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 <= sc1) || (((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((\valid[s] == 1 && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= s) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString1 == 0) && nondetString2 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 <= sc1)) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && sc1 + 1 <= unknown-#length-unknown[sc1]) && 1 <= c) && !(unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == unknown-#memory_int-unknown[s2][s2])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) || ((((((((((((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((\valid[s] == 1 && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= s) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) || (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((0 == s && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && s2 == 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset))) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && sc1 + 1 <= unknown-#length-unknown[sc1]) && 1 <= c) && 0 == sc1) && !(unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == unknown-#memory_int-unknown[s2][s2])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1)))) || ((((((sc1 + 1 <= unknown-#length-unknown[sc1] && (((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((((c + 1 <= 0 && 0 == s) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && s2 == 0) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 <= sc1) || (((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((((c + 1 <= 0 && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && s2 == 0) && 1 <= s) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 <= sc1))) && !(nondetString1 == nondetString2)) && !(unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == unknown-#memory_int-unknown[s2][s2])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0)) || (((((((((((((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((\valid[s] == 1 && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= s) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && nondetString2 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) || (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((0 == s && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && s2 == 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset))) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && sc1 + 1 <= unknown-#length-unknown[sc1]) && 1 <= c) && 0 == sc1) && s2 == s) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && s2 == s) && 1 <= unknown-#memory_int-unknown[sc1][sc1]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1)))) || ((((((!(nondetString1 == nondetString2) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && (((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((((((c + 1 <= 0 && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 2 <= unknown-#length-unknown[sc1] && 0 == sc1) && s2 == 0) && 1 <= s) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (!(nondetString1 + length1 == 1) || (1 == length1 && !(nondetString1 == nondetString2)))) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) || (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((((((c + 1 <= 0 && 0 == s) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 2 <= unknown-#length-unknown[sc1] && 0 == sc1) && s2 == 0) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (!(nondetString1 + length1 == 1) || (1 == length1 && !(nondetString1 == nondetString2)))) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)))) && s2 == s) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && s2 == s) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1)))) || ((((((((((((((((((((0 == unknown-#memory_int-unknown[s2][s2] && 1 == length2 + nondetString2) && \valid[s] == 1) && s1 <= sc1) && !(0 == c)) && 0 == s) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && unknown-#length-unknown[nondetString2] == length2) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[s2]) && s2 == 0) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString1 == 0) && nondetString2 == 0) && 0 == unknown-#memory_int-unknown[s][s]) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2])) || (((((!(nondetString1 == nondetString2) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && (((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ((((((((((((((((((c + 1 <= 0 && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 2 <= unknown-#length-unknown[sc1] && 0 == sc1) && s2 == 0) && 1 <= s) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (!(nondetString1 + length1 == 1) || (1 == length1 && !(nondetString1 == nondetString2)))) && s + 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) || (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && (((((((((((((((((((c + 1 <= 0 && 0 == s) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 2 <= unknown-#length-unknown[sc1] && 0 == sc1) && s2 == 0) && unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0) && nondetString1 == 0) && \valid[sc1] == 1) && sc1 <= s1) && 1 == \valid[nondetString2]) && \valid[s] == 1) && s1 <= sc1) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && nondetString2 == 0) && (!(nondetString1 + length1 == 1) || (1 == length1 && !(nondetString1 == nondetString2)))) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)))) && !(unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == unknown-#memory_int-unknown[s2][s2])) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 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] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) 148.10/100.80 - StatisticsResult: Ultimate Automizer benchmark data 148.10/100.80 CFG has 1 procedures, 35 locations, 16 error locations. SAFE Result, 88.7s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 28.5s AutomataDifference, 0.0s DeadEndRemovalTime, 51.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 7067 SDslu, 2447 SDs, 0 SdLazy, 6918 SolverSat, 807 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 374 SyntacticMatches, 6 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2759 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=31, 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1675 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 120 NumberOfFragments, 2506 HoareAnnotationTreeSize, 2 FomulaSimplifications, 121261904 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 2 FomulaSimplificationsInter, 20565265 FormulaSimplificationTreeSizeReductionInter, 48.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 969 ConstructedInterpolants, 168 QuantifiedInterpolants, 388574 SizeOfPredicates, 136 NumberOfNonLiveVariables, 2036 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 387/685 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 148.10/100.80 - StatisticsResult: Constructed decomposition of program 148.10/100.80 Your program was decomposed into 9 terminating modules (7 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s and consists of 6 locations. 7 modules have a trivial ranking function, the largest among these consists of 10 locations. 148.10/100.80 - StatisticsResult: Timing statistics 148.10/100.80 BüchiAutomizer plugin needed 6.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 1.0s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 63 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 127 SDtfs, 707 SDslu, 543 SDs, 0 SdLazy, 1273 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf100 lsp97 ukn78 mio100 lsp36 div111 bol100 ite100 ukn100 eq171 hnf88 smp94 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 148.10/100.80 - TerminationAnalysisResult: Termination proven 148.10/100.80 Buchi Automizer proved that your program is terminating 148.10/100.80 RESULT: Ultimate proved your program to be correct! 148.10/100.80 !SESSION 2019-03-28 12:40:13.923 ----------------------------------------------- 148.10/100.80 eclipse.buildId=unknown 148.10/100.80 java.version=1.8.0_181 148.10/100.80 java.vendor=Oracle Corporation 148.10/100.80 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 148.10/100.80 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 148.10/100.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 148.10/100.80 148.10/100.80 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:53.799 148.10/100.80 !MESSAGE The workspace will exit with unsaved changes in this session. 148.10/100.80 Received shutdown request... 148.10/100.80 Ultimate: 148.10/100.80 GTK+ Version Check 148.10/100.80 EOF