58.18/27.87 YES 58.18/27.87 58.18/27.87 Ultimate: Cannot open display: 58.18/27.87 This is Ultimate 0.1.24-8dc7c08-m 58.18/27.87 [2019-03-28 12:50:15,207 INFO L170 SettingsManager]: Resetting all preferences to default values... 58.18/27.87 [2019-03-28 12:50:15,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 58.18/27.87 [2019-03-28 12:50:15,220 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 58.18/27.87 [2019-03-28 12:50:15,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 58.18/27.87 [2019-03-28 12:50:15,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 58.18/27.87 [2019-03-28 12:50:15,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 58.18/27.87 [2019-03-28 12:50:15,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 58.18/27.87 [2019-03-28 12:50:15,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 58.18/27.87 [2019-03-28 12:50:15,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 58.18/27.87 [2019-03-28 12:50:15,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 58.18/27.87 [2019-03-28 12:50:15,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 58.18/27.87 [2019-03-28 12:50:15,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 58.18/27.87 [2019-03-28 12:50:15,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 58.18/27.87 [2019-03-28 12:50:15,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 58.18/27.87 [2019-03-28 12:50:15,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 58.18/27.87 [2019-03-28 12:50:15,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 58.18/27.87 [2019-03-28 12:50:15,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 58.18/27.87 [2019-03-28 12:50:15,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 58.18/27.87 [2019-03-28 12:50:15,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 58.18/27.87 [2019-03-28 12:50:15,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 58.18/27.87 [2019-03-28 12:50:15,242 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 58.18/27.87 [2019-03-28 12:50:15,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 58.18/27.87 [2019-03-28 12:50:15,244 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 58.18/27.87 [2019-03-28 12:50:15,244 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 58.18/27.87 [2019-03-28 12:50:15,245 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 58.18/27.87 [2019-03-28 12:50:15,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 58.18/27.87 [2019-03-28 12:50:15,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 58.18/27.87 [2019-03-28 12:50:15,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 58.18/27.87 [2019-03-28 12:50:15,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 58.18/27.87 [2019-03-28 12:50:15,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 58.18/27.87 [2019-03-28 12:50:15,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 58.18/27.87 [2019-03-28 12:50:15,250 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 58.18/27.87 [2019-03-28 12:50:15,264 INFO L110 SettingsManager]: Loading preferences was successful 58.18/27.87 [2019-03-28 12:50:15,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 58.18/27.87 [2019-03-28 12:50:15,266 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 58.18/27.87 [2019-03-28 12:50:15,266 INFO L133 SettingsManager]: * Rewrite not-equals=true 58.18/27.87 [2019-03-28 12:50:15,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 58.18/27.87 [2019-03-28 12:50:15,266 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 58.18/27.87 [2019-03-28 12:50:15,266 INFO L133 SettingsManager]: * Use SBE=true 58.18/27.87 [2019-03-28 12:50:15,266 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Use old map elimination=false 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 58.18/27.87 [2019-03-28 12:50:15,267 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 58.18/27.87 [2019-03-28 12:50:15,268 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 58.18/27.87 [2019-03-28 12:50:15,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 58.18/27.87 [2019-03-28 12:50:15,268 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 58.18/27.87 [2019-03-28 12:50:15,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE 58.18/27.87 [2019-03-28 12:50:15,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 58.18/27.87 [2019-03-28 12:50:15,269 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 58.18/27.87 [2019-03-28 12:50:15,269 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 58.18/27.87 [2019-03-28 12:50:15,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 58.18/27.87 [2019-03-28 12:50:15,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 58.18/27.87 [2019-03-28 12:50:15,269 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 58.18/27.87 [2019-03-28 12:50:15,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 58.18/27.87 [2019-03-28 12:50:15,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 58.18/27.87 [2019-03-28 12:50:15,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 58.18/27.87 [2019-03-28 12:50:15,270 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 58.18/27.87 [2019-03-28 12:50:15,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 58.18/27.87 [2019-03-28 12:50:15,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 58.18/27.87 [2019-03-28 12:50:15,309 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 58.18/27.87 [2019-03-28 12:50:15,312 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 58.18/27.87 [2019-03-28 12:50:15,313 INFO L271 PluginConnector]: Initializing CDTParser... 58.18/27.87 [2019-03-28 12:50:15,314 INFO L276 PluginConnector]: CDTParser initialized 58.18/27.87 [2019-03-28 12:50:15,315 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 58.18/27.87 [2019-03-28 12:50:15,423 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/bd58ec1ad27e4a8a9b14d1515c202af3/FLAG2a37a3fed 58.18/27.87 [2019-03-28 12:50:15,770 INFO L307 CDTParser]: Found 1 translation units. 58.18/27.87 [2019-03-28 12:50:15,771 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 58.18/27.87 [2019-03-28 12:50:15,771 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 58.18/27.87 [2019-03-28 12:50:15,778 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/bd58ec1ad27e4a8a9b14d1515c202af3/FLAG2a37a3fed 58.18/27.87 [2019-03-28 12:50:16,178 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/bd58ec1ad27e4a8a9b14d1515c202af3 58.18/27.87 [2019-03-28 12:50:16,189 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 58.18/27.87 [2019-03-28 12:50:16,191 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 58.18/27.87 [2019-03-28 12:50:16,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 58.18/27.87 [2019-03-28 12:50:16,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 58.18/27.87 [2019-03-28 12:50:16,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 58.18/27.87 [2019-03-28 12:50:16,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c973742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16, skipping insertion in model container 58.18/27.87 [2019-03-28 12:50:16,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 58.18/27.87 [2019-03-28 12:50:16,227 INFO L176 MainTranslator]: Built tables and reachable declarations 58.18/27.87 [2019-03-28 12:50:16,400 INFO L206 PostProcessor]: Analyzing one entry point: main 58.18/27.87 [2019-03-28 12:50:16,413 INFO L191 MainTranslator]: Completed pre-run 58.18/27.87 [2019-03-28 12:50:16,494 INFO L206 PostProcessor]: Analyzing one entry point: main 58.18/27.87 [2019-03-28 12:50:16,511 INFO L195 MainTranslator]: Completed translation 58.18/27.87 [2019-03-28 12:50:16,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16 WrapperNode 58.18/27.87 [2019-03-28 12:50:16,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 58.18/27.87 [2019-03-28 12:50:16,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 58.18/27.87 [2019-03-28 12:50:16,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 58.18/27.87 [2019-03-28 12:50:16,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 58.18/27.87 [2019-03-28 12:50:16,522 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:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,531 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:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 58.18/27.87 [2019-03-28 12:50:16,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 58.18/27.87 [2019-03-28 12:50:16,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 58.18/27.87 [2019-03-28 12:50:16,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized 58.18/27.87 [2019-03-28 12:50:16,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 58.18/27.87 [2019-03-28 12:50:16,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 58.18/27.87 [2019-03-28 12:50:16,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... 58.18/27.87 [2019-03-28 12:50:16,581 INFO L276 PluginConnector]: RCFGBuilder initialized 58.18/27.87 [2019-03-28 12:50:16,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (1/1) ... 58.18/27.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.87 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 58.18/27.87 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 58.18/27.87 [2019-03-28 12:50:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 58.18/27.87 [2019-03-28 12:50:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 58.18/27.87 [2019-03-28 12:50:16,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 58.18/27.87 [2019-03-28 12:50:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 58.18/27.87 [2019-03-28 12:50:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 58.18/27.87 [2019-03-28 12:50:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 58.18/27.87 [2019-03-28 12:50:16,892 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 58.18/27.87 [2019-03-28 12:50:16,892 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 58.18/27.87 [2019-03-28 12:50:16,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:16 BoogieIcfgContainer 58.18/27.87 [2019-03-28 12:50:16,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 58.18/27.87 [2019-03-28 12:50:16,895 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 58.18/27.87 [2019-03-28 12:50:16,895 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 58.18/27.87 [2019-03-28 12:50:16,897 INFO L276 PluginConnector]: BlockEncodingV2 initialized 58.18/27.87 [2019-03-28 12:50:16,898 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:16" (1/1) ... 58.18/27.87 [2019-03-28 12:50:16,915 INFO L313 BlockEncoder]: Initial Icfg 31 locations, 38 edges 58.18/27.87 [2019-03-28 12:50:16,917 INFO L258 BlockEncoder]: Using Remove infeasible edges 58.18/27.87 [2019-03-28 12:50:16,917 INFO L263 BlockEncoder]: Using Maximize final states 58.18/27.87 [2019-03-28 12:50:16,918 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 58.18/27.87 [2019-03-28 12:50:16,918 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 58.18/27.87 [2019-03-28 12:50:16,920 INFO L296 BlockEncoder]: Using Remove sink states 58.18/27.87 [2019-03-28 12:50:16,921 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 58.18/27.87 [2019-03-28 12:50:16,921 INFO L179 BlockEncoder]: Using Rewrite not-equals 58.18/27.87 [2019-03-28 12:50:16,949 INFO L185 BlockEncoder]: Using Use SBE 58.18/27.87 [2019-03-28 12:50:16,979 INFO L200 BlockEncoder]: SBE split 13 edges 58.18/27.87 [2019-03-28 12:50:16,984 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 58.18/27.87 [2019-03-28 12:50:16,986 INFO L71 MaximizeFinalStates]: 0 new accepting states 58.18/27.87 [2019-03-28 12:50:17,013 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 58.18/27.87 [2019-03-28 12:50:17,016 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 58.18/27.87 [2019-03-28 12:50:17,017 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 58.18/27.87 [2019-03-28 12:50:17,018 INFO L71 MaximizeFinalStates]: 0 new accepting states 58.18/27.87 [2019-03-28 12:50:17,018 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 58.18/27.87 [2019-03-28 12:50:17,018 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 58.18/27.87 [2019-03-28 12:50:17,019 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 41 edges 58.18/27.87 [2019-03-28 12:50:17,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17 BasicIcfg 58.18/27.87 [2019-03-28 12:50:17,020 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 58.18/27.87 [2019-03-28 12:50:17,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 58.18/27.87 [2019-03-28 12:50:17,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... 58.18/27.87 [2019-03-28 12:50:17,024 INFO L276 PluginConnector]: TraceAbstraction initialized 58.18/27.87 [2019-03-28 12:50:17,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:50:16" (1/4) ... 58.18/27.87 [2019-03-28 12:50:17,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f6d0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:17, skipping insertion in model container 58.18/27.87 [2019-03-28 12:50:17,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (2/4) ... 58.18/27.87 [2019-03-28 12:50:17,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f6d0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:17, skipping insertion in model container 58.18/27.87 [2019-03-28 12:50:17,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:16" (3/4) ... 58.18/27.87 [2019-03-28 12:50:17,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f6d0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:17, skipping insertion in model container 58.18/27.87 [2019-03-28 12:50:17,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17" (4/4) ... 58.18/27.87 [2019-03-28 12:50:17,028 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 58.18/27.87 [2019-03-28 12:50:17,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 58.18/27.87 [2019-03-28 12:50:17,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 58.18/27.87 [2019-03-28 12:50:17,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 58.18/27.87 [2019-03-28 12:50:17,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation 58.18/27.87 [2019-03-28 12:50:17,093 INFO L382 AbstractCegarLoop]: Interprodecural is true 58.18/27.87 [2019-03-28 12:50:17,094 INFO L383 AbstractCegarLoop]: Hoare is true 58.18/27.87 [2019-03-28 12:50:17,094 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 58.18/27.87 [2019-03-28 12:50:17,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 58.18/27.87 [2019-03-28 12:50:17,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 58.18/27.87 [2019-03-28 12:50:17,094 INFO L387 AbstractCegarLoop]: Difference is false 58.18/27.87 [2019-03-28 12:50:17,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 58.18/27.87 [2019-03-28 12:50:17,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 58.18/27.87 [2019-03-28 12:50:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. 58.18/27.87 [2019-03-28 12:50:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 58.18/27.87 [2019-03-28 12:50:17,116 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:17,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:17,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash 175224190, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:17,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:17,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:17,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 58.18/27.87 [2019-03-28 12:50:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 58.18/27.87 [2019-03-28 12:50:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 58.18/27.87 [2019-03-28 12:50:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 58.18/27.87 [2019-03-28 12:50:17,313 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. 58.18/27.87 [2019-03-28 12:50:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:17,418 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. 58.18/27.87 [2019-03-28 12:50:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 58.18/27.87 [2019-03-28 12:50:17,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:17,434 INFO L225 Difference]: With dead ends: 23 58.18/27.87 [2019-03-28 12:50:17,434 INFO L226 Difference]: Without dead ends: 22 58.18/27.87 [2019-03-28 12:50:17,438 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 58.18/27.87 [2019-03-28 12:50:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 58.18/27.87 [2019-03-28 12:50:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. 58.18/27.87 [2019-03-28 12:50:17,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:17,478 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 39 transitions. 58.18/27.87 [2019-03-28 12:50:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 58.18/27.87 [2019-03-28 12:50:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. 58.18/27.87 [2019-03-28 12:50:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 58.18/27.87 [2019-03-28 12:50:17,479 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:17,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:17,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash 175224192, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:17,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:17,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:17,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:17,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 58.18/27.87 [2019-03-28 12:50:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 58.18/27.87 [2019-03-28 12:50:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.18/27.87 [2019-03-28 12:50:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 58.18/27.87 [2019-03-28 12:50:17,528 INFO L87 Difference]: Start difference. First operand 22 states and 39 transitions. Second operand 4 states. 58.18/27.87 [2019-03-28 12:50:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:17,603 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. 58.18/27.87 [2019-03-28 12:50:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.87 [2019-03-28 12:50:17,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:17,605 INFO L225 Difference]: With dead ends: 23 58.18/27.87 [2019-03-28 12:50:17,605 INFO L226 Difference]: Without dead ends: 22 58.18/27.87 [2019-03-28 12:50:17,606 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 58.18/27.87 [2019-03-28 12:50:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 58.18/27.87 [2019-03-28 12:50:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. 58.18/27.87 [2019-03-28 12:50:17,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:17,611 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 38 transitions. 58.18/27.87 [2019-03-28 12:50:17,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 58.18/27.87 [2019-03-28 12:50:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 38 transitions. 58.18/27.87 [2019-03-28 12:50:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 58.18/27.87 [2019-03-28 12:50:17,611 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:17,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:17,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash 175224193, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:17,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:17,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:17,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:17,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 58.18/27.87 [2019-03-28 12:50:17,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 58.18/27.87 [2019-03-28 12:50:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 58.18/27.87 [2019-03-28 12:50:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 58.18/27.87 [2019-03-28 12:50:17,644 INFO L87 Difference]: Start difference. First operand 22 states and 38 transitions. Second operand 3 states. 58.18/27.87 [2019-03-28 12:50:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:17,707 INFO L93 Difference]: Finished difference Result 22 states and 38 transitions. 58.18/27.87 [2019-03-28 12:50:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 58.18/27.87 [2019-03-28 12:50:17,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:17,732 INFO L225 Difference]: With dead ends: 22 58.18/27.87 [2019-03-28 12:50:17,732 INFO L226 Difference]: Without dead ends: 21 58.18/27.87 [2019-03-28 12:50:17,732 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 58.18/27.87 [2019-03-28 12:50:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 58.18/27.87 [2019-03-28 12:50:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 58.18/27.87 [2019-03-28 12:50:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 58.18/27.87 [2019-03-28 12:50:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:17,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 58.18/27.87 [2019-03-28 12:50:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:17,737 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:17,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 58.18/27.87 [2019-03-28 12:50:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 58.18/27.87 [2019-03-28 12:50:17,738 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:17,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:17,738 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1719456963, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:17,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:17,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:17,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:17,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.87 [2019-03-28 12:50:17,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 58.18/27.87 [2019-03-28 12:50:17,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.87 [2019-03-28 12:50:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.87 [2019-03-28 12:50:17,791 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 5 states. 58.18/27.87 [2019-03-28 12:50:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:17,909 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.18/27.87 [2019-03-28 12:50:17,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 58.18/27.87 [2019-03-28 12:50:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:17,911 INFO L225 Difference]: With dead ends: 21 58.18/27.87 [2019-03-28 12:50:17,911 INFO L226 Difference]: Without dead ends: 20 58.18/27.87 [2019-03-28 12:50:17,911 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 58.18/27.87 [2019-03-28 12:50:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 58.18/27.87 [2019-03-28 12:50:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 58.18/27.87 [2019-03-28 12:50:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 58.18/27.87 [2019-03-28 12:50:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. 58.18/27.87 [2019-03-28 12:50:17,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 8 58.18/27.87 [2019-03-28 12:50:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:17,916 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. 58.18/27.87 [2019-03-28 12:50:17,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 58.18/27.87 [2019-03-28 12:50:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. 58.18/27.87 [2019-03-28 12:50:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 58.18/27.87 [2019-03-28 12:50:17,916 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:17,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:17,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1719456965, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:17,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:18,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:18,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 58.18/27.87 [2019-03-28 12:50:18,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 58.18/27.87 [2019-03-28 12:50:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 58.18/27.87 [2019-03-28 12:50:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 58.18/27.87 [2019-03-28 12:50:18,021 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 7 states. 58.18/27.87 [2019-03-28 12:50:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:18,219 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. 58.18/27.87 [2019-03-28 12:50:18,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 58.18/27.87 [2019-03-28 12:50:18,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 58.18/27.87 [2019-03-28 12:50:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:18,220 INFO L225 Difference]: With dead ends: 27 58.18/27.87 [2019-03-28 12:50:18,221 INFO L226 Difference]: Without dead ends: 26 58.18/27.87 [2019-03-28 12:50:18,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 58.18/27.87 [2019-03-28 12:50:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 58.18/27.87 [2019-03-28 12:50:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. 58.18/27.87 [2019-03-28 12:50:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,227 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 8 58.18/27.87 [2019-03-28 12:50:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:18,227 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 58.18/27.87 [2019-03-28 12:50:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 58.18/27.87 [2019-03-28 12:50:18,228 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:18,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:18,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557298, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:18,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:18,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:18,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 58.18/27.87 [2019-03-28 12:50:18,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 58.18/27.87 [2019-03-28 12:50:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 58.18/27.87 [2019-03-28 12:50:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 58.18/27.87 [2019-03-28 12:50:18,289 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 6 states. 58.18/27.87 [2019-03-28 12:50:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:18,407 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. 58.18/27.87 [2019-03-28 12:50:18,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 58.18/27.87 [2019-03-28 12:50:18,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:18,408 INFO L225 Difference]: With dead ends: 27 58.18/27.87 [2019-03-28 12:50:18,408 INFO L226 Difference]: Without dead ends: 26 58.18/27.87 [2019-03-28 12:50:18,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 58.18/27.87 [2019-03-28 12:50:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 58.18/27.87 [2019-03-28 12:50:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. 58.18/27.87 [2019-03-28 12:50:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 58.18/27.87 [2019-03-28 12:50:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. 58.18/27.87 [2019-03-28 12:50:18,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:18,415 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 41 transitions. 58.18/27.87 [2019-03-28 12:50:18,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 58.18/27.87 [2019-03-28 12:50:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 41 transitions. 58.18/27.87 [2019-03-28 12:50:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 58.18/27.87 [2019-03-28 12:50:18,415 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:18,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:18,416 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557295, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:18,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:18,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:18,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:18,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 58.18/27.87 [2019-03-28 12:50:18,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 58.18/27.87 [2019-03-28 12:50:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 58.18/27.87 [2019-03-28 12:50:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 58.18/27.87 [2019-03-28 12:50:18,484 INFO L87 Difference]: Start difference. First operand 23 states and 41 transitions. Second operand 6 states. 58.18/27.87 [2019-03-28 12:50:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:18,591 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. 58.18/27.87 [2019-03-28 12:50:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 58.18/27.87 [2019-03-28 12:50:18,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:18,593 INFO L225 Difference]: With dead ends: 23 58.18/27.87 [2019-03-28 12:50:18,593 INFO L226 Difference]: Without dead ends: 22 58.18/27.87 [2019-03-28 12:50:18,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 58.18/27.87 [2019-03-28 12:50:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 58.18/27.87 [2019-03-28 12:50:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:18,598 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 58.18/27.87 [2019-03-28 12:50:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. 58.18/27.87 [2019-03-28 12:50:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 58.18/27.87 [2019-03-28 12:50:18,599 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:18,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:18,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557297, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:18,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:18,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:18,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 58.18/27.87 [2019-03-28 12:50:18,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 58.18/27.87 [2019-03-28 12:50:18,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 58.18/27.87 [2019-03-28 12:50:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 58.18/27.87 [2019-03-28 12:50:18,675 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 7 states. 58.18/27.87 [2019-03-28 12:50:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:18,820 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. 58.18/27.87 [2019-03-28 12:50:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 58.18/27.87 [2019-03-28 12:50:18,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:18,822 INFO L225 Difference]: With dead ends: 24 58.18/27.87 [2019-03-28 12:50:18,822 INFO L226 Difference]: Without dead ends: 23 58.18/27.87 [2019-03-28 12:50:18,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 58.18/27.87 [2019-03-28 12:50:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 58.18/27.87 [2019-03-28 12:50:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. 58.18/27.87 [2019-03-28 12:50:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.18/27.87 [2019-03-28 12:50:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. 58.18/27.87 [2019-03-28 12:50:18,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 58.18/27.87 [2019-03-28 12:50:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:18,827 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. 58.18/27.87 [2019-03-28 12:50:18,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 58.18/27.87 [2019-03-28 12:50:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. 58.18/27.87 [2019-03-28 12:50:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 58.18/27.87 [2019-03-28 12:50:18,828 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.87 [2019-03-28 12:50:18,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.87 [2019-03-28 12:50:18,828 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.87 [2019-03-28 12:50:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.87 [2019-03-28 12:50:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash 492655594, now seen corresponding path program 1 times 58.18/27.87 [2019-03-28 12:50:18,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.87 [2019-03-28 12:50:18,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.87 [2019-03-28 12:50:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.87 [2019-03-28 12:50:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.87 [2019-03-28 12:50:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.87 [2019-03-28 12:50:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.87 [2019-03-28 12:50:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.87 [2019-03-28 12:50:18,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 58.18/27.87 [2019-03-28 12:50:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.87 [2019-03-28 12:50:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.87 [2019-03-28 12:50:18,876 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 5 states. 58.18/27.87 [2019-03-28 12:50:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.87 [2019-03-28 12:50:18,985 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. 58.18/27.87 [2019-03-28 12:50:18,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 58.18/27.87 [2019-03-28 12:50:18,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 58.18/27.87 [2019-03-28 12:50:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.87 [2019-03-28 12:50:18,988 INFO L225 Difference]: With dead ends: 22 58.18/27.87 [2019-03-28 12:50:18,988 INFO L226 Difference]: Without dead ends: 21 58.18/27.87 [2019-03-28 12:50:18,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 58.18/27.87 [2019-03-28 12:50:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 58.18/27.87 [2019-03-28 12:50:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 58.18/27.87 [2019-03-28 12:50:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 58.18/27.87 [2019-03-28 12:50:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. 58.18/27.87 [2019-03-28 12:50:18,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 13 58.18/27.87 [2019-03-28 12:50:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.87 [2019-03-28 12:50:18,993 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. 58.18/27.87 [2019-03-28 12:50:18,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 58.18/27.87 [2019-03-28 12:50:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. 58.18/27.87 [2019-03-28 12:50:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 58.18/27.88 [2019-03-28 12:50:18,994 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:18,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:18,994 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash 492655596, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:18,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:18,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:18,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:19,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:19,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 58.18/27.88 [2019-03-28 12:50:19,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 58.18/27.88 [2019-03-28 12:50:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 58.18/27.88 [2019-03-28 12:50:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 58.18/27.88 [2019-03-28 12:50:19,095 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 9 states. 58.18/27.88 [2019-03-28 12:50:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:19,345 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. 58.18/27.88 [2019-03-28 12:50:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 58.18/27.88 [2019-03-28 12:50:19,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:19,346 INFO L225 Difference]: With dead ends: 30 58.18/27.88 [2019-03-28 12:50:19,346 INFO L226 Difference]: Without dead ends: 29 58.18/27.88 [2019-03-28 12:50:19,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 58.18/27.88 [2019-03-28 12:50:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. 58.18/27.88 [2019-03-28 12:50:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 58.18/27.88 [2019-03-28 12:50:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:19,351 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:19,351 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:19,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 58.18/27.88 [2019-03-28 12:50:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 58.18/27.88 [2019-03-28 12:50:19,352 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:19,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:19,352 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash 492655597, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:19,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:19,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 58.18/27.88 [2019-03-28 12:50:19,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 58.18/27.88 [2019-03-28 12:50:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 58.18/27.88 [2019-03-28 12:50:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 58.18/27.88 [2019-03-28 12:50:19,422 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand 8 states. 58.18/27.88 [2019-03-28 12:50:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:19,567 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:19,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 58.18/27.88 [2019-03-28 12:50:19,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:19,569 INFO L225 Difference]: With dead ends: 26 58.18/27.88 [2019-03-28 12:50:19,569 INFO L226 Difference]: Without dead ends: 25 58.18/27.88 [2019-03-28 12:50:19,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 58.18/27.88 [2019-03-28 12:50:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 58.18/27.88 [2019-03-28 12:50:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 58.18/27.88 [2019-03-28 12:50:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 58.18/27.88 [2019-03-28 12:50:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 58.18/27.88 [2019-03-28 12:50:19,574 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:19,574 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 58.18/27.88 [2019-03-28 12:50:19,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 58.18/27.88 [2019-03-28 12:50:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 58.18/27.88 [2019-03-28 12:50:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 58.18/27.88 [2019-03-28 12:50:19,575 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:19,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:19,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 492655627, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:19,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:19,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.88 [2019-03-28 12:50:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 58.18/27.88 [2019-03-28 12:50:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.18/27.88 [2019-03-28 12:50:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:19,610 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. 58.18/27.88 [2019-03-28 12:50:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:19,674 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. 58.18/27.88 [2019-03-28 12:50:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:19,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:19,675 INFO L225 Difference]: With dead ends: 36 58.18/27.88 [2019-03-28 12:50:19,675 INFO L226 Difference]: Without dead ends: 32 58.18/27.88 [2019-03-28 12:50:19,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 58.18/27.88 [2019-03-28 12:50:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. 58.18/27.88 [2019-03-28 12:50:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 58.18/27.88 [2019-03-28 12:50:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. 58.18/27.88 [2019-03-28 12:50:19,681 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:19,681 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. 58.18/27.88 [2019-03-28 12:50:19,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:19,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. 58.18/27.88 [2019-03-28 12:50:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 58.18/27.88 [2019-03-28 12:50:19,682 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:19,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:19,682 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2059501334, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:19,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:19,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.88 [2019-03-28 12:50:19,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 58.18/27.88 [2019-03-28 12:50:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.18/27.88 [2019-03-28 12:50:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:19,712 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. 58.18/27.88 [2019-03-28 12:50:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:19,762 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. 58.18/27.88 [2019-03-28 12:50:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:19,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:19,764 INFO L225 Difference]: With dead ends: 45 58.18/27.88 [2019-03-28 12:50:19,764 INFO L226 Difference]: Without dead ends: 26 58.18/27.88 [2019-03-28 12:50:19,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 58.18/27.88 [2019-03-28 12:50:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. 58.18/27.88 [2019-03-28 12:50:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 58.18/27.88 [2019-03-28 12:50:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:19,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 13 58.18/27.88 [2019-03-28 12:50:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:19,769 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:19,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 58.18/27.88 [2019-03-28 12:50:19,769 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:19,770 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:19,770 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:19,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1859314095, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:19,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:19,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:19,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:19,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:19,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:19,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:20,023 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 58.18/27.88 [2019-03-28 12:50:20,023 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:20,033 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:20,034 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. 58.18/27.88 [2019-03-28 12:50:20,034 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 58.18/27.88 [2019-03-28 12:50:20,135 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:20,135 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 58.18/27.88 [2019-03-28 12:50:20,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 58.18/27.88 [2019-03-28 12:50:20,156 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:20,163 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 58.18/27.88 [2019-03-28 12:50:20,163 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 58.18/27.88 [2019-03-28 12:50:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:20,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:20,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 58.18/27.88 [2019-03-28 12:50:20,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states 58.18/27.88 [2019-03-28 12:50:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. 58.18/27.88 [2019-03-28 12:50:20,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 58.18/27.88 [2019-03-28 12:50:20,244 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 14 states. 58.18/27.88 [2019-03-28 12:50:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:20,888 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. 58.18/27.88 [2019-03-28 12:50:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 58.18/27.88 [2019-03-28 12:50:20,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 58.18/27.88 [2019-03-28 12:50:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:20,890 INFO L225 Difference]: With dead ends: 31 58.18/27.88 [2019-03-28 12:50:20,890 INFO L226 Difference]: Without dead ends: 30 58.18/27.88 [2019-03-28 12:50:20,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 58.18/27.88 [2019-03-28 12:50:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 58.18/27.88 [2019-03-28 12:50:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. 58.18/27.88 [2019-03-28 12:50:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:20,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 14 58.18/27.88 [2019-03-28 12:50:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:20,896 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. 58.18/27.88 [2019-03-28 12:50:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 58.18/27.88 [2019-03-28 12:50:20,897 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:20,897 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:20,898 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1859314094, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:20,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:20,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:20,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:20,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:20,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:20,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:21,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:21,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:21,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:21,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 58.18/27.88 [2019-03-28 12:50:21,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 58.18/27.88 [2019-03-28 12:50:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 58.18/27.88 [2019-03-28 12:50:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 58.18/27.88 [2019-03-28 12:50:21,045 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 9 states. 58.18/27.88 [2019-03-28 12:50:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:21,199 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:21,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 58.18/27.88 [2019-03-28 12:50:21,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 58.18/27.88 [2019-03-28 12:50:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:21,200 INFO L225 Difference]: With dead ends: 30 58.18/27.88 [2019-03-28 12:50:21,200 INFO L226 Difference]: Without dead ends: 29 58.18/27.88 [2019-03-28 12:50:21,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 58.18/27.88 [2019-03-28 12:50:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 58.18/27.88 [2019-03-28 12:50:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:21,206 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 14 58.18/27.88 [2019-03-28 12:50:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:21,206 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:21,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 58.18/27.88 [2019-03-28 12:50:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 58.18/27.88 [2019-03-28 12:50:21,207 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:21,207 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:21,207 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1804163162, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:21,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:21,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:21,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:21,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:21,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:21,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 58.18/27.88 [2019-03-28 12:50:21,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 58.18/27.88 [2019-03-28 12:50:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 58.18/27.88 [2019-03-28 12:50:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 58.18/27.88 [2019-03-28 12:50:21,356 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 9 states. 58.18/27.88 [2019-03-28 12:50:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:21,491 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 58.18/27.88 [2019-03-28 12:50:21,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 58.18/27.88 [2019-03-28 12:50:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:21,493 INFO L225 Difference]: With dead ends: 30 58.18/27.88 [2019-03-28 12:50:21,493 INFO L226 Difference]: Without dead ends: 29 58.18/27.88 [2019-03-28 12:50:21,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 58.18/27.88 [2019-03-28 12:50:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 58.18/27.88 [2019-03-28 12:50:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 58.18/27.88 [2019-03-28 12:50:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:21,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 58.18/27.88 [2019-03-28 12:50:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:21,498 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:21,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 58.18/27.88 [2019-03-28 12:50:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 58.18/27.88 [2019-03-28 12:50:21,499 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:21,499 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:21,499 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1804163163, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:21,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:21,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:21,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:21,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:21,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:21,660 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:21,662 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 58.18/27.88 [2019-03-28 12:50:21,662 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:21,674 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:21,674 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:21,675 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 58.18/27.88 [2019-03-28 12:50:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 58.18/27.88 [2019-03-28 12:50:21,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 58.18/27.88 [2019-03-28 12:50:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 58.18/27.88 [2019-03-28 12:50:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 58.18/27.88 [2019-03-28 12:50:21,878 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 17 states. 58.18/27.88 [2019-03-28 12:50:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:22,636 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. 58.18/27.88 [2019-03-28 12:50:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 58.18/27.88 [2019-03-28 12:50:22,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 58.18/27.88 [2019-03-28 12:50:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:22,638 INFO L225 Difference]: With dead ends: 62 58.18/27.88 [2019-03-28 12:50:22,638 INFO L226 Difference]: Without dead ends: 61 58.18/27.88 [2019-03-28 12:50:22,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 58.18/27.88 [2019-03-28 12:50:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. 58.18/27.88 [2019-03-28 12:50:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. 58.18/27.88 [2019-03-28 12:50:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 58.18/27.88 [2019-03-28 12:50:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:22,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 58.18/27.88 [2019-03-28 12:50:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:22,645 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:22,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 58.18/27.88 [2019-03-28 12:50:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. 58.18/27.88 [2019-03-28 12:50:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 58.18/27.88 [2019-03-28 12:50:22,645 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:22,646 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:22,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1804133372, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:22,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:22,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:22,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.88 [2019-03-28 12:50:22,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 58.18/27.88 [2019-03-28 12:50:22,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.18/27.88 [2019-03-28 12:50:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:22,672 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand 4 states. 58.18/27.88 [2019-03-28 12:50:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:22,722 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. 58.18/27.88 [2019-03-28 12:50:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:22,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 58.18/27.88 [2019-03-28 12:50:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:22,737 INFO L225 Difference]: With dead ends: 44 58.18/27.88 [2019-03-28 12:50:22,737 INFO L226 Difference]: Without dead ends: 30 58.18/27.88 [2019-03-28 12:50:22,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 58.18/27.88 [2019-03-28 12:50:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 58.18/27.88 [2019-03-28 12:50:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 58.18/27.88 [2019-03-28 12:50:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:22,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 15 58.18/27.88 [2019-03-28 12:50:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:22,742 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:22,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 58.18/27.88 [2019-03-28 12:50:22,743 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:22,743 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:22,744 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 799917429, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:22,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:22,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:22,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:22,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 39 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:22,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:22,889 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:22,890 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 58.18/27.88 [2019-03-28 12:50:22,891 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:22,900 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:22,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:22,901 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 58.18/27.88 [2019-03-28 12:50:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:23,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:23,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 58.18/27.88 [2019-03-28 12:50:23,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 58.18/27.88 [2019-03-28 12:50:23,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 58.18/27.88 [2019-03-28 12:50:23,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 58.18/27.88 [2019-03-28 12:50:23,105 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 18 states. 58.18/27.88 [2019-03-28 12:50:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:24,289 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. 58.18/27.88 [2019-03-28 12:50:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 58.18/27.88 [2019-03-28 12:50:24,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 58.18/27.88 [2019-03-28 12:50:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:24,290 INFO L225 Difference]: With dead ends: 66 58.18/27.88 [2019-03-28 12:50:24,290 INFO L226 Difference]: Without dead ends: 65 58.18/27.88 [2019-03-28 12:50:24,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 58.18/27.88 [2019-03-28 12:50:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. 58.18/27.88 [2019-03-28 12:50:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 30. 58.18/27.88 [2019-03-28 12:50:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 58.18/27.88 [2019-03-28 12:50:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:24,296 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 16 58.18/27.88 [2019-03-28 12:50:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:24,296 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:24,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 58.18/27.88 [2019-03-28 12:50:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. 58.18/27.88 [2019-03-28 12:50:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 58.18/27.88 [2019-03-28 12:50:24,297 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:24,297 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:24,297 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash 799917460, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:24,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:24,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:24,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:24,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:24,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:24,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:24,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:24,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 58.18/27.88 [2019-03-28 12:50:24,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 58.18/27.88 [2019-03-28 12:50:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.88 [2019-03-28 12:50:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:24,404 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 5 states. 58.18/27.88 [2019-03-28 12:50:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:24,478 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. 58.18/27.88 [2019-03-28 12:50:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:24,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 58.18/27.88 [2019-03-28 12:50:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:24,479 INFO L225 Difference]: With dead ends: 37 58.18/27.88 [2019-03-28 12:50:24,479 INFO L226 Difference]: Without dead ends: 27 58.18/27.88 [2019-03-28 12:50:24,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 58.18/27.88 [2019-03-28 12:50:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 58.18/27.88 [2019-03-28 12:50:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 58.18/27.88 [2019-03-28 12:50:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 58.18/27.88 [2019-03-28 12:50:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. 58.18/27.88 [2019-03-28 12:50:24,484 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 16 58.18/27.88 [2019-03-28 12:50:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:24,484 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. 58.18/27.88 [2019-03-28 12:50:24,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. 58.18/27.88 [2019-03-28 12:50:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 58.18/27.88 [2019-03-28 12:50:24,485 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:24,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:24,485 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:24,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:24,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1587994113, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:24,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:24,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:24,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:24,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:24,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 58.18/27.88 [2019-03-28 12:50:24,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 58.18/27.88 [2019-03-28 12:50:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.88 [2019-03-28 12:50:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:24,520 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. 58.18/27.88 [2019-03-28 12:50:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:24,585 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. 58.18/27.88 [2019-03-28 12:50:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:24,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 58.18/27.88 [2019-03-28 12:50:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:24,586 INFO L225 Difference]: With dead ends: 40 58.18/27.88 [2019-03-28 12:50:24,586 INFO L226 Difference]: Without dead ends: 34 58.18/27.88 [2019-03-28 12:50:24,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 58.18/27.88 [2019-03-28 12:50:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. 58.18/27.88 [2019-03-28 12:50:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 58.18/27.88 [2019-03-28 12:50:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. 58.18/27.88 [2019-03-28 12:50:24,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 19 58.18/27.88 [2019-03-28 12:50:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:24,592 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. 58.18/27.88 [2019-03-28 12:50:24,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. 58.18/27.88 [2019-03-28 12:50:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 58.18/27.88 [2019-03-28 12:50:24,593 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:24,593 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:24,593 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1934946595, now seen corresponding path program 2 times 58.18/27.88 [2019-03-28 12:50:24,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:24,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:24,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 58.18/27.88 [2019-03-28 12:50:24,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 58.18/27.88 [2019-03-28 12:50:24,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:24,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:24,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:24,932 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:24,934 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 58.18/27.88 [2019-03-28 12:50:24,934 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:24,944 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:24,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:24,945 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 58.18/27.88 [2019-03-28 12:50:24,973 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 58.18/27.88 [2019-03-28 12:50:24,973 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:24,982 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:24,983 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. 58.18/27.88 [2019-03-28 12:50:24,984 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 58.18/27.88 [2019-03-28 12:50:25,086 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:25,088 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 24 treesize of output 23 58.18/27.88 [2019-03-28 12:50:25,088 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:25,101 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:25,102 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:25,103 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:22 58.18/27.88 [2019-03-28 12:50:25,191 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:25,192 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 58.18/27.88 [2019-03-28 12:50:25,193 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 58.18/27.88 [2019-03-28 12:50:25,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:25,209 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:25,209 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 58.18/27.88 [2019-03-28 12:50:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:25,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:25,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 58.18/27.88 [2019-03-28 12:50:25,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 58.18/27.88 [2019-03-28 12:50:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 58.18/27.88 [2019-03-28 12:50:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 58.18/27.88 [2019-03-28 12:50:25,358 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 21 states. 58.18/27.88 [2019-03-28 12:50:25,910 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 58.18/27.88 [2019-03-28 12:50:26,157 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 58.18/27.88 [2019-03-28 12:50:26,771 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 58.18/27.88 [2019-03-28 12:50:27,322 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 58.18/27.88 [2019-03-28 12:50:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:27,534 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. 58.18/27.88 [2019-03-28 12:50:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 58.18/27.88 [2019-03-28 12:50:27,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 58.18/27.88 [2019-03-28 12:50:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:27,535 INFO L225 Difference]: With dead ends: 66 58.18/27.88 [2019-03-28 12:50:27,535 INFO L226 Difference]: Without dead ends: 65 58.18/27.88 [2019-03-28 12:50:27,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 58.18/27.88 [2019-03-28 12:50:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. 58.18/27.88 [2019-03-28 12:50:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. 58.18/27.88 [2019-03-28 12:50:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 58.18/27.88 [2019-03-28 12:50:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. 58.18/27.88 [2019-03-28 12:50:27,544 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 20 58.18/27.88 [2019-03-28 12:50:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:27,545 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. 58.18/27.88 [2019-03-28 12:50:27,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 58.18/27.88 [2019-03-28 12:50:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. 58.18/27.88 [2019-03-28 12:50:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 58.18/27.88 [2019-03-28 12:50:27,546 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:27,546 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:27,546 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 146196633, now seen corresponding path program 2 times 58.18/27.88 [2019-03-28 12:50:27,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:27,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:27,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:27,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:27,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 58.18/27.88 [2019-03-28 12:50:27,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 58.18/27.88 [2019-03-28 12:50:27,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:27,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:27,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:27,718 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:27,719 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 58.18/27.88 [2019-03-28 12:50:27,719 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:27,732 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:27,732 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:27,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 58.18/27.88 [2019-03-28 12:50:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:27,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 58.18/27.88 [2019-03-28 12:50:27,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states 58.18/27.88 [2019-03-28 12:50:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. 58.18/27.88 [2019-03-28 12:50:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 58.18/27.88 [2019-03-28 12:50:27,947 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand 20 states. 58.18/27.88 [2019-03-28 12:50:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:29,270 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. 58.18/27.88 [2019-03-28 12:50:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 58.18/27.88 [2019-03-28 12:50:29,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 58.18/27.88 [2019-03-28 12:50:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:29,271 INFO L225 Difference]: With dead ends: 106 58.18/27.88 [2019-03-28 12:50:29,271 INFO L226 Difference]: Without dead ends: 105 58.18/27.88 [2019-03-28 12:50:29,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=416, Invalid=1654, Unknown=0, NotChecked=0, Total=2070 58.18/27.88 [2019-03-28 12:50:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. 58.18/27.88 [2019-03-28 12:50:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. 58.18/27.88 [2019-03-28 12:50:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 58.18/27.88 [2019-03-28 12:50:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. 58.18/27.88 [2019-03-28 12:50:29,280 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 21 58.18/27.88 [2019-03-28 12:50:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. 58.18/27.88 [2019-03-28 12:50:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. 58.18/27.88 [2019-03-28 12:50:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. 58.18/27.88 [2019-03-28 12:50:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 58.18/27.88 [2019-03-28 12:50:29,282 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:29,282 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:29,282 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 146226424, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:29,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:29,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:29,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:29,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:29,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 58.18/27.88 [2019-03-28 12:50:29,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 58.18/27.88 [2019-03-28 12:50:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.88 [2019-03-28 12:50:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:29,383 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand 5 states. 58.18/27.88 [2019-03-28 12:50:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:29,429 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. 58.18/27.88 [2019-03-28 12:50:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:29,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 58.18/27.88 [2019-03-28 12:50:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:29,430 INFO L225 Difference]: With dead ends: 69 58.18/27.88 [2019-03-28 12:50:29,430 INFO L226 Difference]: Without dead ends: 27 58.18/27.88 [2019-03-28 12:50:29,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 58.18/27.88 [2019-03-28 12:50:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 58.18/27.88 [2019-03-28 12:50:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 58.18/27.88 [2019-03-28 12:50:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 58.18/27.88 [2019-03-28 12:50:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. 58.18/27.88 [2019-03-28 12:50:29,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 58.18/27.88 [2019-03-28 12:50:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:29,435 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. 58.18/27.88 [2019-03-28 12:50:29,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. 58.18/27.88 [2019-03-28 12:50:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 58.18/27.88 [2019-03-28 12:50:29,436 INFO L394 BasicCegarLoop]: Found error trace 58.18/27.88 [2019-03-28 12:50:29,436 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:29,436 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 58.18/27.88 [2019-03-28 12:50:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1175388074, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:29,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:29,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:29,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:29,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.18/27.88 [2019-03-28 12:50:29,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.18/27.88 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.18/27.88 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.18/27.88 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.18/27.88 [2019-03-28 12:50:29,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:29,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 56 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:29,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:29,705 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:29,706 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 58.18/27.88 [2019-03-28 12:50:29,706 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,714 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,714 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,714 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 58.18/27.88 [2019-03-28 12:50:29,737 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 58.18/27.88 [2019-03-28 12:50:29,738 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,743 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,743 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,743 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 58.18/27.88 [2019-03-28 12:50:29,810 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:29,811 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 23 treesize of output 22 58.18/27.88 [2019-03-28 12:50:29,811 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,818 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,818 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,818 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 58.18/27.88 [2019-03-28 12:50:29,847 INFO L189 IndexEqualityManager]: detected not equals via solver 58.18/27.88 [2019-03-28 12:50:29,848 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 23 treesize of output 22 58.18/27.88 [2019-03-28 12:50:29,848 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,856 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,857 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:15 58.18/27.88 [2019-03-28 12:50:29,911 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,911 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 19 treesize of output 19 58.18/27.88 [2019-03-28 12:50:29,912 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,921 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 58.18/27.88 [2019-03-28 12:50:29,923 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 58.18/27.88 [2019-03-28 12:50:29,923 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 58.18/27.88 [2019-03-28 12:50:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 58.18/27.88 [2019-03-28 12:50:30,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states 58.18/27.88 [2019-03-28 12:50:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. 58.18/27.88 [2019-03-28 12:50:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 58.18/27.88 [2019-03-28 12:50:30,038 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 24 states. 58.18/27.88 [2019-03-28 12:50:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:30,880 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. 58.18/27.88 [2019-03-28 12:50:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 58.18/27.88 [2019-03-28 12:50:30,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 58.18/27.88 [2019-03-28 12:50:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 58.18/27.88 [2019-03-28 12:50:30,881 INFO L225 Difference]: With dead ends: 49 58.18/27.88 [2019-03-28 12:50:30,881 INFO L226 Difference]: Without dead ends: 0 58.18/27.88 [2019-03-28 12:50:30,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 58.18/27.88 [2019-03-28 12:50:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 58.18/27.88 [2019-03-28 12:50:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 58.18/27.88 [2019-03-28 12:50:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 58.18/27.88 [2019-03-28 12:50:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 58.18/27.88 [2019-03-28 12:50:30,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 58.18/27.88 [2019-03-28 12:50:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. 58.18/27.88 [2019-03-28 12:50:30,883 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 58.18/27.88 [2019-03-28 12:50:30,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. 58.18/27.88 [2019-03-28 12:50:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 58.18/27.88 [2019-03-28 12:50:30,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 58.18/27.88 [2019-03-28 12:50:30,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 58.18/27.88 [2019-03-28 12:50:30,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 58.18/27.88 [2019-03-28 12:50:31,107 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 183 58.18/27.88 [2019-03-28 12:50:31,270 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 58.18/27.88 [2019-03-28 12:50:33,481 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 179 DAG size of output: 94 58.18/27.88 [2019-03-28 12:50:33,484 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,499 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 28 42) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,499 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,500 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,500 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,500 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: (and (<= 1 ULTIMATE.start_cstrncpy_~n) (<= 1 ULTIMATE.start_main_~length~0) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= ULTIMATE.start_main_~nondetArea~0.offset 0) (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) (+ (select |#length| ULTIMATE.start_cstrncpy_~d~0.base) 1)) (= 0 ULTIMATE.start_cstrncpy_~dst.offset) (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)) (<= 1 (select |#length| ULTIMATE.start_cstrncpy_~src.base)) (<= 1 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base) 1) (= ULTIMATE.start_main_~nondetString~0.offset 0) (= 0 ULTIMATE.start_cstrncpy_~src.offset) (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base)) (= (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base)) (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1) (= (select |#valid| ULTIMATE.start_cstrncpy_~dst.base) 1)) 58.18/27.88 [2019-03-28 12:50:33,500 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 22) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,500 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 36) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,501 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 23) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 23) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 24) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,502 INFO L444 ceAbstractionStarter]: At program point L16-4(lines 16 23) the Hoare annotation is: (let ((.cse21 (select |#length| ULTIMATE.start_cstrncpy_~s~0.base))) (let ((.cse16 (select |#length| ULTIMATE.start_cstrncpy_~d~0.base)) (.cse2 (<= 1 ULTIMATE.start_main_~length~0)) (.cse15 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse17 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse3 (= 0 ULTIMATE.start_cstrncpy_~dst.offset)) (.cse4 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse20 (select |#length| ULTIMATE.start_cstrncpy_~src.base)) (.cse5 (<= 1 ULTIMATE.start_main_~n~0)) (.cse6 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse7 (= (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base) 1)) (.cse8 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse9 (= 0 ULTIMATE.start_cstrncpy_~src.offset)) (.cse11 (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base))) (.cse10 (= (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base) 1)) (.cse18 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base))) (.cse19 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse13 (= (select |#valid| ULTIMATE.start_cstrncpy_~dst.base) 1)) (.cse14 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse1 (<= 1 ULTIMATE.start_cstrncpy_~n)) (.cse0 (= (select (select |#memory_int| ULTIMATE.start_cstrncpy_~s~0.base) (+ .cse21 (- 1))) 0)) (.cse12 (not (= ULTIMATE.start_cstrncpy_~d~0.base ULTIMATE.start_cstrncpy_~s~0.base)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_cstrncpy_~d~0.offset 0) .cse13 (not (= ULTIMATE.start_cstrncpy_~src.base ULTIMATE.start_cstrncpy_~dst.base)) .cse14 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 1 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_cstrncpy_~src.offset ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~src.base)))) .cse15 (<= ULTIMATE.start_cstrncpy_~n .cse16) .cse17 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstrncpy_~s~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~s~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~s~0.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) .cse18 .cse19 (= 0 ULTIMATE.start_cstrncpy_~s~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src.base) (+ .cse20 (- 1))))) (and (<= (+ ULTIMATE.start_cstrncpy_~s~0.offset 1) .cse21) (and (and (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) .cse16) (and .cse2 .cse15 .cse17 .cse3 .cse4 (<= 1 .cse20) .cse5 (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) .cse6 .cse7 .cse8 .cse9 .cse11 .cse10 .cse18 (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) .cse19 .cse13)) .cse14 .cse1) .cse0 .cse12)))) 58.18/27.88 [2019-03-28 12:50:33,503 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. 58.18/27.88 [2019-03-28 12:50:33,503 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 58.18/27.88 [2019-03-28 12:50:33,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.18/27.88 [2019-03-28 12:50:33,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.18/27.88 [2019-03-28 12:50:33,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:33,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:33 BasicIcfg 58.18/27.88 [2019-03-28 12:50:33,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 58.18/27.88 [2019-03-28 12:50:33,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 58.18/27.88 [2019-03-28 12:50:33,558 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 58.18/27.88 [2019-03-28 12:50:33,561 INFO L276 PluginConnector]: BuchiAutomizer initialized 58.18/27.88 [2019-03-28 12:50:33,562 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 58.18/27.88 [2019-03-28 12:50:33,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:50:16" (1/5) ... 58.18/27.88 [2019-03-28 12:50:33,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d5cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:33, skipping insertion in model container 58.18/27.88 [2019-03-28 12:50:33,563 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 58.18/27.88 [2019-03-28 12:50:33,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:16" (2/5) ... 58.18/27.88 [2019-03-28 12:50:33,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d5cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:33, skipping insertion in model container 58.18/27.88 [2019-03-28 12:50:33,564 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 58.18/27.88 [2019-03-28 12:50:33,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:16" (3/5) ... 58.18/27.88 [2019-03-28 12:50:33,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d5cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:33, skipping insertion in model container 58.18/27.88 [2019-03-28 12:50:33,564 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 58.18/27.88 [2019-03-28 12:50:33,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17" (4/5) ... 58.18/27.88 [2019-03-28 12:50:33,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d5cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:33, skipping insertion in model container 58.18/27.88 [2019-03-28 12:50:33,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 58.18/27.88 [2019-03-28 12:50:33,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:33" (5/5) ... 58.18/27.88 [2019-03-28 12:50:33,566 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 58.18/27.88 [2019-03-28 12:50:33,589 INFO L133 ementStrategyFactory]: Using default assertion order modulation 58.18/27.88 [2019-03-28 12:50:33,589 INFO L374 BuchiCegarLoop]: Interprodecural is true 58.18/27.88 [2019-03-28 12:50:33,589 INFO L375 BuchiCegarLoop]: Hoare is true 58.18/27.88 [2019-03-28 12:50:33,589 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 58.18/27.88 [2019-03-28 12:50:33,590 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 58.18/27.88 [2019-03-28 12:50:33,590 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 58.18/27.88 [2019-03-28 12:50:33,590 INFO L379 BuchiCegarLoop]: Difference is false 58.18/27.88 [2019-03-28 12:50:33,590 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 58.18/27.88 [2019-03-28 12:50:33,590 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 58.18/27.88 [2019-03-28 12:50:33,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 58.18/27.88 [2019-03-28 12:50:33,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 58.18/27.88 [2019-03-28 12:50:33,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:33,599 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:33,603 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,603 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,603 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 58.18/27.88 [2019-03-28 12:50:33,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. 58.18/27.88 [2019-03-28 12:50:33,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 58.18/27.88 [2019-03-28 12:50:33,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:33,605 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:33,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,605 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,610 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 16#L31true [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 12#L31-2true [75] L31-2-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 20#L34-1true [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 9#L39true [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 21#L12true [136] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3) (< v_ULTIMATE.start_cstrncpy_~n_4 0)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 22#L16-4true 58.18/27.88 [2019-03-28 12:50:33,611 INFO L796 eck$LassoCheckResult]: Loop: 22#L16-4true [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 8#L17true [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 5#L17-1true [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 3#L17-2true [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 4#L16-1true [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 25#L16-2true [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 22#L16-4true 58.18/27.88 [2019-03-28 12:50:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1133079923, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:33,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:33,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:33,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:33,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 58.18/27.88 [2019-03-28 12:50:33,642 INFO L799 eck$LassoCheckResult]: stem already infeasible 58.18/27.88 [2019-03-28 12:50:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:33,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:33,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.18/27.88 [2019-03-28 12:50:33,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.18/27.88 [2019-03-28 12:50:33,767 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. 58.18/27.88 [2019-03-28 12:50:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:33,828 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. 58.18/27.88 [2019-03-28 12:50:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.18/27.88 [2019-03-28 12:50:33,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 56 transitions. 58.18/27.88 [2019-03-28 12:50:33,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 58.18/27.88 [2019-03-28 12:50:33,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 32 transitions. 58.18/27.88 [2019-03-28 12:50:33,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 58.18/27.88 [2019-03-28 12:50:33,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 58.18/27.88 [2019-03-28 12:50:33,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. 58.18/27.88 [2019-03-28 12:50:33,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 58.18/27.88 [2019-03-28 12:50:33,835 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. 58.18/27.88 [2019-03-28 12:50:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. 58.18/27.88 [2019-03-28 12:50:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. 58.18/27.88 [2019-03-28 12:50:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 58.18/27.88 [2019-03-28 12:50:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. 58.18/27.88 [2019-03-28 12:50:33,837 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. 58.18/27.88 [2019-03-28 12:50:33,838 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. 58.18/27.88 [2019-03-28 12:50:33,838 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 58.18/27.88 [2019-03-28 12:50:33,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 24 transitions. 58.18/27.88 [2019-03-28 12:50:33,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 58.18/27.88 [2019-03-28 12:50:33,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:33,839 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:33,839 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,839 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:33,840 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 80#L31 [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 78#L31-2 [75] L31-2-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 79#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 75#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 76#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 82#L16-4 58.18/27.88 [2019-03-28 12:50:33,840 INFO L796 eck$LassoCheckResult]: Loop: 82#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 74#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 72#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 68#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 69#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 71#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 82#L16-4 58.18/27.88 [2019-03-28 12:50:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1133079922, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:33,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 2 times 58.18/27.88 [2019-03-28 12:50:33,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:33,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash -419895170, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:33,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:33,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:33,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:33,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:33,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.18/27.88 [2019-03-28 12:50:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.18/27.88 [2019-03-28 12:50:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.18/27.88 [2019-03-28 12:50:33,967 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. 58.18/27.88 [2019-03-28 12:50:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:34,040 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.18/27.88 [2019-03-28 12:50:34,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,042 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 58.18/27.88 [2019-03-28 12:50:34,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 58.18/27.88 [2019-03-28 12:50:34,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 58.18/27.88 [2019-03-28 12:50:34,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 58.18/27.88 [2019-03-28 12:50:34,043 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 42 transitions. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:34,045 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 58.18/27.88 [2019-03-28 12:50:34,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 38 transitions. 58.18/27.88 [2019-03-28 12:50:34,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 58.18/27.88 [2019-03-28 12:50:34,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:34,047 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:34,047 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:34,047 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:34,048 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 137#L31 [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 134#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 135#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 131#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 132#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 139#L16-4 58.18/27.88 [2019-03-28 12:50:34,048 INFO L796 eck$LassoCheckResult]: Loop: 139#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 130#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 128#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 124#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 125#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 127#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 139#L16-4 58.18/27.88 [2019-03-28 12:50:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1134211980, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:34,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 3 times 58.18/27.88 [2019-03-28 12:50:34,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash 702526232, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:34,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:34,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.18/27.88 [2019-03-28 12:50:34,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 58.18/27.88 [2019-03-28 12:50:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 58.18/27.88 [2019-03-28 12:50:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 58.18/27.88 [2019-03-28 12:50:34,209 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. cyclomatic complexity: 17 Second operand 8 states. 58.18/27.88 [2019-03-28 12:50:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.18/27.88 [2019-03-28 12:50:34,373 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 58.18/27.88 [2019-03-28 12:50:34,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 58.18/27.88 [2019-03-28 12:50:34,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 58.18/27.88 [2019-03-28 12:50:34,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 58.18/27.88 [2019-03-28 12:50:34,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 58.18/27.88 [2019-03-28 12:50:34,377 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 64 transitions. 58.18/27.88 [2019-03-28 12:50:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. 58.18/27.88 [2019-03-28 12:50:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 58.18/27.88 [2019-03-28 12:50:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. 58.18/27.88 [2019-03-28 12:50:34,379 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 50 transitions. 58.18/27.88 [2019-03-28 12:50:34,379 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 50 transitions. 58.18/27.88 [2019-03-28 12:50:34,379 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 58.18/27.88 [2019-03-28 12:50:34,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 50 transitions. 58.18/27.88 [2019-03-28 12:50:34,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 58.18/27.88 [2019-03-28 12:50:34,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:34,380 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:34,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:34,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:34,381 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 223#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 224#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 226#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 218#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 219#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 236#L16-4 58.18/27.88 [2019-03-28 12:50:34,382 INFO L796 eck$LassoCheckResult]: Loop: 236#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 240#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 239#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 238#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 237#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 235#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 236#L16-4 58.18/27.88 [2019-03-28 12:50:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1136982543, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:34,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 4 times 58.18/27.88 [2019-03-28 12:50:34,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -393360549, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:34,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:34,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:34,705 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 58.18/27.88 [2019-03-28 12:50:34,809 INFO L216 LassoAnalysis]: Preferences: 58.18/27.88 [2019-03-28 12:50:34,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 58.18/27.88 [2019-03-28 12:50:34,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 58.18/27.88 [2019-03-28 12:50:34,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 58.18/27.88 [2019-03-28 12:50:34,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false 58.18/27.88 [2019-03-28 12:50:34,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 58.18/27.88 [2019-03-28 12:50:34,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 58.18/27.88 [2019-03-28 12:50:34,811 INFO L130 ssoRankerPreferences]: Path of dumped script: 58.18/27.88 [2019-03-28 12:50:34,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 58.18/27.88 [2019-03-28 12:50:34,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 58.18/27.88 [2019-03-28 12:50:34,812 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 58.18/27.88 [2019-03-28 12:50:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:34,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:34,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:34,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:34,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,098 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 58.18/27.88 [2019-03-28 12:50:35,224 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 58.18/27.88 [2019-03-28 12:50:35,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:35,701 INFO L300 LassoAnalysis]: Preprocessing complete. 58.18/27.88 [2019-03-28 12:50:35,706 INFO L497 LassoAnalysis]: Using template 'affine'. 58.18/27.88 [2019-03-28 12:50:35,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:35,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:35,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:35,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:35,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:35,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:35,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:35,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:35,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:35,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:35,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:35,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:35,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:35,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 58.18/27.88 [2019-03-28 12:50:35,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 58.18/27.88 [2019-03-28 12:50:35,874 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. 58.18/27.88 [2019-03-28 12:50:35,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 58.18/27.88 [2019-03-28 12:50:35,877 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 58.18/27.88 [2019-03-28 12:50:35,878 INFO L518 LassoAnalysis]: Proved termination. 58.18/27.88 [2019-03-28 12:50:35,878 INFO L520 LassoAnalysis]: Termination argument consisting of: 58.18/27.88 Ranking function f(ULTIMATE.start_cstrncpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1) = -1*ULTIMATE.start_cstrncpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 58.18/27.88 Supporting invariants [] 58.18/27.88 [2019-03-28 12:50:35,919 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed 58.18/27.88 [2019-03-28 12:50:35,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.18/27.88 [2019-03-28 12:50:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:35,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:35,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:36,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:36,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.18/27.88 [2019-03-28 12:50:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:36,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:36,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:36,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:36,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.18/27.88 [2019-03-28 12:50:36,211 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 58.18/27.88 [2019-03-28 12:50:36,215 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 58.18/27.88 [2019-03-28 12:50:36,216 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 50 transitions. cyclomatic complexity: 21 Second operand 6 states. 58.18/27.88 [2019-03-28 12:50:36,527 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 50 transitions. cyclomatic complexity: 21. Second operand 6 states. Result 51 states and 76 transitions. Complement of second has 11 states. 58.18/27.88 [2019-03-28 12:50:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states 58.18/27.88 [2019-03-28 12:50:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 58.18/27.88 [2019-03-28 12:50:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. 58.18/27.88 [2019-03-28 12:50:36,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 6 letters. Loop has 6 letters. 58.18/27.88 [2019-03-28 12:50:36,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.18/27.88 [2019-03-28 12:50:36,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 12 letters. Loop has 6 letters. 58.18/27.88 [2019-03-28 12:50:36,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.18/27.88 [2019-03-28 12:50:36,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 6 letters. Loop has 12 letters. 58.18/27.88 [2019-03-28 12:50:36,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.18/27.88 [2019-03-28 12:50:36,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 76 transitions. 58.18/27.88 [2019-03-28 12:50:36,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.18/27.88 [2019-03-28 12:50:36,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 36 states and 54 transitions. 58.18/27.88 [2019-03-28 12:50:36,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 58.18/27.88 [2019-03-28 12:50:36,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 58.18/27.88 [2019-03-28 12:50:36,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 54 transitions. 58.18/27.88 [2019-03-28 12:50:36,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.18/27.88 [2019-03-28 12:50:36,541 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 54 transitions. 58.18/27.88 [2019-03-28 12:50:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 54 transitions. 58.18/27.88 [2019-03-28 12:50:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. 58.18/27.88 [2019-03-28 12:50:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 58.18/27.88 [2019-03-28 12:50:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. 58.18/27.88 [2019-03-28 12:50:36,543 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. 58.18/27.88 [2019-03-28 12:50:36,543 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. 58.18/27.88 [2019-03-28 12:50:36,543 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 58.18/27.88 [2019-03-28 12:50:36,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions. 58.18/27.88 [2019-03-28 12:50:36,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.18/27.88 [2019-03-28 12:50:36,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.18/27.88 [2019-03-28 12:50:36,544 INFO L119 BuchiIsEmpty]: Starting construction of run 58.18/27.88 [2019-03-28 12:50:36,545 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.18/27.88 [2019-03-28 12:50:36,545 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.18/27.88 [2019-03-28 12:50:36,546 INFO L794 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 484#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 481#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 482#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 478#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 479#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 487#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 488#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 474#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 469#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 470#L19-3 58.18/27.88 [2019-03-28 12:50:36,546 INFO L796 eck$LassoCheckResult]: Loop: 470#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 472#L19-1 [147] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (> |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0)) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 480#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 470#L19-3 58.18/27.88 [2019-03-28 12:50:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2051803749, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:36,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 128686, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:36,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash 689169108, now seen corresponding path program 1 times 58.18/27.88 [2019-03-28 12:50:36,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.18/27.88 [2019-03-28 12:50:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.18/27.88 [2019-03-28 12:50:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.18/27.88 [2019-03-28 12:50:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.18/27.88 [2019-03-28 12:50:37,136 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 58.18/27.88 [2019-03-28 12:50:37,293 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 91 58.18/27.88 [2019-03-28 12:50:37,295 INFO L216 LassoAnalysis]: Preferences: 58.18/27.88 [2019-03-28 12:50:37,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 58.18/27.88 [2019-03-28 12:50:37,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 58.18/27.88 [2019-03-28 12:50:37,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 58.18/27.88 [2019-03-28 12:50:37,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false 58.18/27.88 [2019-03-28 12:50:37,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 58.18/27.88 [2019-03-28 12:50:37,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 58.18/27.88 [2019-03-28 12:50:37,296 INFO L130 ssoRankerPreferences]: Path of dumped script: 58.18/27.88 [2019-03-28 12:50:37,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 58.18/27.88 [2019-03-28 12:50:37,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 58.18/27.88 [2019-03-28 12:50:37,296 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 58.18/27.88 [2019-03-28 12:50:37,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,593 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 58.18/27.88 [2019-03-28 12:50:37,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:37,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 58.18/27.88 [2019-03-28 12:50:38,124 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 58.18/27.88 [2019-03-28 12:50:38,268 INFO L300 LassoAnalysis]: Preprocessing complete. 58.18/27.88 [2019-03-28 12:50:38,269 INFO L497 LassoAnalysis]: Using template 'affine'. 58.18/27.88 [2019-03-28 12:50:38,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 58.18/27.88 [2019-03-28 12:50:38,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 58.18/27.88 [2019-03-28 12:50:38,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 58.18/27.88 Termination analysis: LINEAR_WITH_GUESSES 58.18/27.88 Number of strict supporting invariants: 0 58.18/27.88 Number of non-strict supporting invariants: 1 58.18/27.88 Consider only non-deceasing supporting invariants: true 58.18/27.88 Simplify termination arguments: true 58.18/27.88 Simplify supporting invariants: trueOverapproximate stem: false 58.18/27.88 [2019-03-28 12:50:38,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. 58.18/27.88 [2019-03-28 12:50:38,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 58.18/27.88 [2019-03-28 12:50:38,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 58.18/27.88 [2019-03-28 12:50:38,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 58.18/27.88 [2019-03-28 12:50:38,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 58.18/27.88 [2019-03-28 12:50:38,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 58.18/27.88 [2019-03-28 12:50:38,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 58.18/27.88 [2019-03-28 12:50:38,348 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 58.18/27.88 [2019-03-28 12:50:38,348 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. 58.18/27.88 [2019-03-28 12:50:38,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 58.18/27.88 [2019-03-28 12:50:38,349 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 58.18/27.88 [2019-03-28 12:50:38,350 INFO L518 LassoAnalysis]: Proved termination. 58.18/27.88 [2019-03-28 12:50:38,350 INFO L520 LassoAnalysis]: Termination argument consisting of: 58.18/27.88 Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n 58.18/27.88 Supporting invariants [] 58.18/27.88 [2019-03-28 12:50:38,383 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed 58.18/27.88 [2019-03-28 12:50:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.18/27.88 [2019-03-28 12:50:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.18/27.88 [2019-03-28 12:50:38,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core 58.18/27.88 [2019-03-28 12:50:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.19/27.88 [2019-03-28 12:50:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.88 [2019-03-28 12:50:38,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 58.19/27.88 [2019-03-28 12:50:38,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.19/27.88 [2019-03-28 12:50:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.88 [2019-03-28 12:50:38,475 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 58.19/27.88 [2019-03-28 12:50:38,475 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 58.19/27.88 [2019-03-28 12:50:38,475 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states and 52 transitions. cyclomatic complexity: 21 Second operand 4 states. 58.19/27.88 [2019-03-28 12:50:38,528 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states and 52 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 42 states and 62 transitions. Complement of second has 8 states. 58.19/27.88 [2019-03-28 12:50:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 58.19/27.88 [2019-03-28 12:50:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 58.19/27.88 [2019-03-28 12:50:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. 58.19/27.88 [2019-03-28 12:50:38,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 10 letters. Loop has 3 letters. 58.19/27.88 [2019-03-28 12:50:38,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.19/27.88 [2019-03-28 12:50:38,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 13 letters. Loop has 3 letters. 58.19/27.88 [2019-03-28 12:50:38,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.19/27.88 [2019-03-28 12:50:38,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. 58.19/27.88 [2019-03-28 12:50:38,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. 58.19/27.88 [2019-03-28 12:50:38,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. 58.19/27.88 [2019-03-28 12:50:38,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.88 [2019-03-28 12:50:38,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 62 transitions. 58.19/27.88 [2019-03-28 12:50:38,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 58.19/27.88 [2019-03-28 12:50:38,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 58.19/27.88 [2019-03-28 12:50:38,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. 58.19/27.88 [2019-03-28 12:50:38,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.19/27.88 [2019-03-28 12:50:38,554 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. 58.19/27.88 [2019-03-28 12:50:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. 58.19/27.88 [2019-03-28 12:50:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. 58.19/27.88 [2019-03-28 12:50:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 58.19/27.88 [2019-03-28 12:50:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. 58.19/27.88 [2019-03-28 12:50:38,557 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 59 transitions. 58.19/27.88 [2019-03-28 12:50:38,557 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 59 transitions. 58.19/27.88 [2019-03-28 12:50:38,557 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 58.19/27.88 [2019-03-28 12:50:38,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 59 transitions. 58.19/27.88 [2019-03-28 12:50:38,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.88 [2019-03-28 12:50:38,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.19/27.88 [2019-03-28 12:50:38,558 INFO L119 BuchiIsEmpty]: Starting construction of run 58.19/27.88 [2019-03-28 12:50:38,559 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.19/27.88 [2019-03-28 12:50:38,559 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.19/27.88 [2019-03-28 12:50:38,559 INFO L794 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 683#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 680#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 681#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 675#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 676#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 686#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 674#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 671#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 660#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 661#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 667#L19-1 58.19/27.88 [2019-03-28 12:50:38,560 INFO L796 eck$LassoCheckResult]: Loop: 667#L19-1 [148] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (< |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 677#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 666#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 667#L19-1 58.19/27.88 [2019-03-28 12:50:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.88 [2019-03-28 12:50:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash 818593319, now seen corresponding path program 1 times 58.19/27.88 [2019-03-28 12:50:38,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.88 [2019-03-28 12:50:38,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.88 [2019-03-28 12:50:38,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.88 [2019-03-28 12:50:38,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.88 [2019-03-28 12:50:38,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash 177077, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:38,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -110593073, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:38,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.19/27.89 [2019-03-28 12:50:38,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.19/27.89 [2019-03-28 12:50:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.19/27.89 [2019-03-28 12:50:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.19/27.89 [2019-03-28 12:50:38,656 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. cyclomatic complexity: 24 Second operand 4 states. 58.19/27.89 [2019-03-28 12:50:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.19/27.89 [2019-03-28 12:50:38,703 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. 58.19/27.89 [2019-03-28 12:50:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.19/27.89 [2019-03-28 12:50:38,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 75 transitions. 58.19/27.89 [2019-03-28 12:50:38,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:38,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 74 transitions. 58.19/27.89 [2019-03-28 12:50:38,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 58.19/27.89 [2019-03-28 12:50:38,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 58.19/27.89 [2019-03-28 12:50:38,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 74 transitions. 58.19/27.89 [2019-03-28 12:50:38,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.19/27.89 [2019-03-28 12:50:38,708 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 74 transitions. 58.19/27.89 [2019-03-28 12:50:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 74 transitions. 58.19/27.89 [2019-03-28 12:50:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. 58.19/27.89 [2019-03-28 12:50:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 58.19/27.89 [2019-03-28 12:50:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. 58.19/27.89 [2019-03-28 12:50:38,711 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 68 transitions. 58.19/27.89 [2019-03-28 12:50:38,711 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 68 transitions. 58.19/27.89 [2019-03-28 12:50:38,711 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 58.19/27.89 [2019-03-28 12:50:38,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 68 transitions. 58.19/27.89 [2019-03-28 12:50:38,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:38,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.19/27.89 [2019-03-28 12:50:38,712 INFO L119 BuchiIsEmpty]: Starting construction of run 58.19/27.89 [2019-03-28 12:50:38,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.19/27.89 [2019-03-28 12:50:38,712 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.19/27.89 [2019-03-28 12:50:38,713 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 785#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 780#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 781#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 775#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 776#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 788#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 789#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 798#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 766#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 768#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 769#L19-1 [147] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (> |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0)) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 779#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 783#L19-3 58.19/27.89 [2019-03-28 12:50:38,713 INFO L796 eck$LassoCheckResult]: Loop: 783#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 777#L19-1 [148] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (< |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 778#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 783#L19-3 58.19/27.89 [2019-03-28 12:50:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash 689169108, now seen corresponding path program 2 times 58.19/27.89 [2019-03-28 12:50:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 128717, now seen corresponding path program 2 times 58.19/27.89 [2019-03-28 12:50:38,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1093320474, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:38,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:38,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.19/27.89 [2019-03-28 12:50:38,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.19/27.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.19/27.89 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.19/27.89 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.19/27.89 [2019-03-28 12:50:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:38,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core 58.19/27.89 [2019-03-28 12:50:38,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.19/27.89 [2019-03-28 12:50:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.19/27.89 [2019-03-28 12:50:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 58.19/27.89 [2019-03-28 12:50:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.19/27.89 [2019-03-28 12:50:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.19/27.89 [2019-03-28 12:50:38,881 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. cyclomatic complexity: 26 Second operand 5 states. 58.19/27.89 [2019-03-28 12:50:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.19/27.89 [2019-03-28 12:50:38,943 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. 58.19/27.89 [2019-03-28 12:50:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.19/27.89 [2019-03-28 12:50:38,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 77 transitions. 58.19/27.89 [2019-03-28 12:50:38,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:38,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 36 states and 50 transitions. 58.19/27.89 [2019-03-28 12:50:38,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 58.19/27.89 [2019-03-28 12:50:38,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 58.19/27.89 [2019-03-28 12:50:38,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 50 transitions. 58.19/27.89 [2019-03-28 12:50:38,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.19/27.89 [2019-03-28 12:50:38,948 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 50 transitions. 58.19/27.89 [2019-03-28 12:50:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 50 transitions. 58.19/27.89 [2019-03-28 12:50:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. 58.19/27.89 [2019-03-28 12:50:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 58.19/27.89 [2019-03-28 12:50:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. 58.19/27.89 [2019-03-28 12:50:38,950 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. 58.19/27.89 [2019-03-28 12:50:38,950 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. 58.19/27.89 [2019-03-28 12:50:38,950 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 58.19/27.89 [2019-03-28 12:50:38,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. 58.19/27.89 [2019-03-28 12:50:38,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:38,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.19/27.89 [2019-03-28 12:50:38,951 INFO L119 BuchiIsEmpty]: Starting construction of run 58.19/27.89 [2019-03-28 12:50:38,951 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.19/27.89 [2019-03-28 12:50:38,951 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.19/27.89 [2019-03-28 12:50:38,952 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 931#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 928#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 929#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 925#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 926#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 933#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 934#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 921#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 918#L17-2 [146] L17-2-->L16-1: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 919#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 920#L16-2 [150] L16-2-->L16-4: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 940#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 943#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 938#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 916#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 917#L19-3 58.19/27.89 [2019-03-28 12:50:38,953 INFO L796 eck$LassoCheckResult]: Loop: 917#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 922#L19-1 [148] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (< |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 927#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 917#L19-3 58.19/27.89 [2019-03-28 12:50:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1087345577, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:38,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:38,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.19/27.89 [2019-03-28 12:50:38,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 58.19/27.89 [2019-03-28 12:50:38,973 INFO L799 eck$LassoCheckResult]: stem already infeasible 58.19/27.89 [2019-03-28 12:50:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash 128717, now seen corresponding path program 3 times 58.19/27.89 [2019-03-28 12:50:38,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 58.19/27.89 [2019-03-28 12:50:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 58.19/27.89 [2019-03-28 12:50:39,032 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 15 Second operand 4 states. 58.19/27.89 [2019-03-28 12:50:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.19/27.89 [2019-03-28 12:50:39,072 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. 58.19/27.89 [2019-03-28 12:50:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.19/27.89 [2019-03-28 12:50:39,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. 58.19/27.89 [2019-03-28 12:50:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:39,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 58.19/27.89 [2019-03-28 12:50:39,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 58.19/27.89 [2019-03-28 12:50:39,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.19/27.89 [2019-03-28 12:50:39,077 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 58.19/27.89 [2019-03-28 12:50:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 58.19/27.89 [2019-03-28 12:50:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,079 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,079 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,079 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 58.19/27.89 [2019-03-28 12:50:39,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. 58.19/27.89 [2019-03-28 12:50:39,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:39,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.19/27.89 [2019-03-28 12:50:39,080 INFO L119 BuchiIsEmpty]: Starting construction of run 58.19/27.89 [2019-03-28 12:50:39,080 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.19/27.89 [2019-03-28 12:50:39,080 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.19/27.89 [2019-03-28 12:50:39,081 INFO L794 eck$LassoCheckResult]: Stem: 999#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 998#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 996#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 997#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 993#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 994#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 1000#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 992#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 990#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 987#L17-2 [146] L17-2-->L16-1: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 988#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 989#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 1001#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1002#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 1003#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 985#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 986#L19-3 58.19/27.89 [2019-03-28 12:50:39,081 INFO L796 eck$LassoCheckResult]: Loop: 986#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 991#L19-1 [148] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (< |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 995#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 986#L19-3 58.19/27.89 [2019-03-28 12:50:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1086422056, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:39,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 128717, now seen corresponding path program 4 times 58.19/27.89 [2019-03-28 12:50:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1273973434, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:39,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 58.19/27.89 [2019-03-28 12:50:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 58.19/27.89 [2019-03-28 12:50:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.19/27.89 [2019-03-28 12:50:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.19/27.89 [2019-03-28 12:50:39,196 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. 58.19/27.89 [2019-03-28 12:50:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.19/27.89 [2019-03-28 12:50:39,250 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. 58.19/27.89 [2019-03-28 12:50:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 58.19/27.89 [2019-03-28 12:50:39,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. 58.19/27.89 [2019-03-28 12:50:39,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:39,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. 58.19/27.89 [2019-03-28 12:50:39,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 58.19/27.89 [2019-03-28 12:50:39,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 58.19/27.89 [2019-03-28 12:50:39,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. 58.19/27.89 [2019-03-28 12:50:39,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 58.19/27.89 [2019-03-28 12:50:39,254 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. 58.19/27.89 [2019-03-28 12:50:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. 58.19/27.89 [2019-03-28 12:50:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. 58.19/27.89 [2019-03-28 12:50:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 58.19/27.89 [2019-03-28 12:50:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. 58.19/27.89 [2019-03-28 12:50:39,256 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. 58.19/27.89 [2019-03-28 12:50:39,256 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. 58.19/27.89 [2019-03-28 12:50:39,256 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 58.19/27.89 [2019-03-28 12:50:39,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. 58.19/27.89 [2019-03-28 12:50:39,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 58.19/27.89 [2019-03-28 12:50:39,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 58.19/27.89 [2019-03-28 12:50:39,257 INFO L119 BuchiIsEmpty]: Starting construction of run 58.19/27.89 [2019-03-28 12:50:39,257 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 58.19/27.89 [2019-03-28 12:50:39,257 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 58.19/27.89 [2019-03-28 12:50:39,258 INFO L794 eck$LassoCheckResult]: Stem: 1062#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 1061#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 1059#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 1060#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 1056#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1057#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 1063#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1064#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 1071#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1070#L17-2 [146] L17-2-->L16-1: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1051#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 1052#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 1065#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1055#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 1053#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1049#L17-2 [146] L17-2-->L16-1: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1050#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 1069#L16-2 [150] L16-2-->L16-4: Formula: (< |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 1068#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1067#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 1066#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 1047#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 1048#L19-3 58.19/27.89 [2019-03-28 12:50:39,258 INFO L796 eck$LassoCheckResult]: Loop: 1048#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 1054#L19-1 [148] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (< |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 1058#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 1048#L19-3 58.19/27.89 [2019-03-28 12:50:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:39,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1676622966, now seen corresponding path program 1 times 58.19/27.89 [2019-03-28 12:50:39,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:39,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:39,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 58.19/27.89 [2019-03-28 12:50:39,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 58.19/27.89 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 58.19/27.89 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 58.19/27.89 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 58.19/27.89 [2019-03-28 12:50:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 58.19/27.89 [2019-03-28 12:50:39,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core 58.19/27.89 [2019-03-28 12:50:39,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... 58.19/27.89 [2019-03-28 12:50:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 58.19/27.89 [2019-03-28 12:50:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 58.19/27.89 [2019-03-28 12:50:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 58.19/27.89 [2019-03-28 12:50:39,367 INFO L799 eck$LassoCheckResult]: stem already infeasible 58.19/27.89 [2019-03-28 12:50:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 58.19/27.89 [2019-03-28 12:50:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 128717, now seen corresponding path program 5 times 58.19/27.89 [2019-03-28 12:50:39,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 58.19/27.89 [2019-03-28 12:50:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 58.19/27.89 [2019-03-28 12:50:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 58.19/27.89 [2019-03-28 12:50:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 58.19/27.89 [2019-03-28 12:50:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 58.19/27.89 [2019-03-28 12:50:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 58.19/27.89 [2019-03-28 12:50:39,419 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 9 Second operand 5 states. 58.19/27.89 [2019-03-28 12:50:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 58.19/27.89 [2019-03-28 12:50:39,462 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. 58.19/27.89 [2019-03-28 12:50:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 58.19/27.89 [2019-03-28 12:50:39,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. 58.19/27.89 [2019-03-28 12:50:39,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 58.19/27.89 [2019-03-28 12:50:39,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 58.19/27.89 [2019-03-28 12:50:39,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 58.19/27.89 [2019-03-28 12:50:39,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 58.19/27.89 [2019-03-28 12:50:39,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 58.19/27.89 [2019-03-28 12:50:39,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 58.19/27.89 [2019-03-28 12:50:39,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 58.19/27.89 [2019-03-28 12:50:39,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:39 BasicIcfg 58.19/27.89 [2019-03-28 12:50:39,474 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 58.19/27.89 [2019-03-28 12:50:39,475 INFO L168 Benchmark]: Toolchain (without parser) took 23284.98 ms. Allocated memory was 649.6 MB in the beginning and 979.9 MB in the end (delta: 330.3 MB). Free memory was 564.9 MB in the beginning and 429.5 MB in the end (delta: 135.4 MB). Peak memory consumption was 465.7 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,476 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. 58.19/27.89 [2019-03-28 12:50:39,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.47 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 564.9 MB in the beginning and 629.0 MB in the end (delta: -64.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.34 ms. Allocated memory is still 662.7 MB. Free memory was 629.0 MB in the beginning and 625.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,477 INFO L168 Benchmark]: Boogie Preprocessor took 26.86 ms. Allocated memory is still 662.7 MB. Free memory was 625.9 MB in the beginning and 624.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,477 INFO L168 Benchmark]: RCFGBuilder took 313.36 ms. Allocated memory is still 662.7 MB. Free memory was 623.2 MB in the beginning and 601.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,478 INFO L168 Benchmark]: BlockEncodingV2 took 125.11 ms. Allocated memory is still 662.7 MB. Free memory was 601.0 MB in the beginning and 591.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,478 INFO L168 Benchmark]: TraceAbstraction took 16536.42 ms. Allocated memory was 662.7 MB in the beginning and 932.7 MB in the end (delta: 270.0 MB). Free memory was 591.5 MB in the beginning and 505.6 MB in the end (delta: 85.9 MB). Peak memory consumption was 356.0 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,479 INFO L168 Benchmark]: BuchiAutomizer took 5916.87 ms. Allocated memory was 932.7 MB in the beginning and 979.9 MB in the end (delta: 47.2 MB). Free memory was 505.6 MB in the beginning and 429.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 123.2 MB. Max. memory is 50.3 GB. 58.19/27.89 [2019-03-28 12:50:39,482 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 58.19/27.89 --- Results --- 58.19/27.89 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 58.19/27.89 - StatisticsResult: Initial Icfg 58.19/27.89 31 locations, 38 edges 58.19/27.89 - StatisticsResult: Encoded RCFG 58.19/27.89 23 locations, 41 edges 58.19/27.89 * Results from de.uni_freiburg.informatik.ultimate.core: 58.19/27.89 - StatisticsResult: Toolchain Benchmarks 58.19/27.89 Benchmark results are: 58.19/27.89 * 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. 58.19/27.89 * CACSL2BoogieTranslator took 319.47 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 564.9 MB in the beginning and 629.0 MB in the end (delta: -64.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. 58.19/27.89 * Boogie Procedure Inliner took 41.34 ms. Allocated memory is still 662.7 MB. Free memory was 629.0 MB in the beginning and 625.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 58.19/27.89 * Boogie Preprocessor took 26.86 ms. Allocated memory is still 662.7 MB. Free memory was 625.9 MB in the beginning and 624.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 58.19/27.89 * RCFGBuilder took 313.36 ms. Allocated memory is still 662.7 MB. Free memory was 623.2 MB in the beginning and 601.0 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 50.3 GB. 58.19/27.89 * BlockEncodingV2 took 125.11 ms. Allocated memory is still 662.7 MB. Free memory was 601.0 MB in the beginning and 591.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 58.19/27.89 * TraceAbstraction took 16536.42 ms. Allocated memory was 662.7 MB in the beginning and 932.7 MB in the end (delta: 270.0 MB). Free memory was 591.5 MB in the beginning and 505.6 MB in the end (delta: 85.9 MB). Peak memory consumption was 356.0 MB. Max. memory is 50.3 GB. 58.19/27.89 * BuchiAutomizer took 5916.87 ms. Allocated memory was 932.7 MB in the beginning and 979.9 MB in the end (delta: 47.2 MB). Free memory was 505.6 MB in the beginning and 429.5 MB in the end (delta: 76.0 MB). Peak memory consumption was 123.2 MB. Max. memory is 50.3 GB. 58.19/27.89 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #memory_int 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 - GenericResult: Unfinished Backtranslation 58.19/27.89 unknown boogie variable #length 58.19/27.89 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 58.19/27.89 - PositiveResult [Line: 17]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 17]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 39]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 20]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 39]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 20]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 17]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - PositiveResult [Line: 17]: pointer dereference always succeeds 58.19/27.89 For all program executions holds that pointer dereference always succeeds at this location 58.19/27.89 - AllSpecificationsHoldResult: All specifications hold 58.19/27.89 8 specifications checked. All of them hold 58.19/27.89 - InvariantResult [Line: 19]: Loop Invariant 58.19/27.89 [2019-03-28 12:50:39,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 Derived loop invariant: ((((((((((((((((((1 <= n && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && d + n <= unknown-#length-unknown[d] + 1) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && 1 <= d) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && n <= unknown-#length-unknown[dst]) && \valid[d] == 1) && 1 == \valid[src]) && 1 <= s) && \valid[nondetString] == 1) && \valid[dst] == 1 58.19/27.89 - InvariantResult [Line: 16]: Loop Invariant 58.19/27.89 [2019-03-28 12:50:39,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 58.19/27.89 [2019-03-28 12:50:39,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 [2019-03-28 12:50:39,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 58.19/27.89 [2019-03-28 12:50:39,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 58.19/27.89 Derived loop invariant: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0 && ((((((((((((((((((((((1 <= n && 1 <= length) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= n) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && \valid[d] == 1) && n <= unknown-#length-unknown[dst]) && !(d == s)) && d == 0) && \valid[dst] == 1) && !(src == dst)) && !(nondetString == nondetArea)) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] && 1 <= ULTIMATE.start_main_~length~0) && src <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src])) && n == unknown-#length-unknown[nondetArea]) && n <= unknown-#length-unknown[d]) && nondetArea == 0) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((s <= ULTIMATE.start_main_~nondetString~0.offset && 1 <= ULTIMATE.start_main_~length~0) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 == \valid[src]) && \valid[nondetString] == 1) && 0 == s) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) || (((s + 1 <= unknown-#length-unknown[s] && ((d + n <= unknown-#length-unknown[d] && ((((((((((((((((1 <= length && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && 1 <= d) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && n <= unknown-#length-unknown[dst]) && \valid[d] == 1) && 1 == \valid[src]) && 1 <= s) && \valid[nondetString] == 1) && \valid[dst] == 1) && !(nondetString == nondetArea)) && 1 <= n) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && !(d == s)) 58.19/27.89 - StatisticsResult: Ultimate Automizer benchmark data 58.19/27.89 CFG has 1 procedures, 23 locations, 8 error locations. SAFE Result, 16.4s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 1540 SDslu, 1554 SDs, 0 SdLazy, 3386 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 137 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 366 HoareAnnotationTreeSize, 2 FomulaSimplifications, 15338 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 2 FomulaSimplificationsInter, 9414 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 478 ConstructedInterpolants, 12 QuantifiedInterpolants, 57754 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1361 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 40/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 58.19/27.89 - StatisticsResult: Constructed decomposition of program 58.19/27.89 Your program was decomposed into 10 terminating modules (8 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 8 locations. 58.19/27.89 - StatisticsResult: Timing statistics 58.19/27.89 BüchiAutomizer plugin needed 5.8s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 4.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 225 SDslu, 476 SDs, 0 SdLazy, 672 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf100 lsp97 ukn85 mio100 lsp49 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 58.19/27.89 - TerminationAnalysisResult: Termination proven 58.19/27.89 Buchi Automizer proved that your program is terminating 58.19/27.89 RESULT: Ultimate proved your program to be correct! 58.19/27.89 !SESSION 2019-03-28 12:50:12.907 ----------------------------------------------- 58.19/27.89 eclipse.buildId=unknown 58.19/27.89 java.version=1.8.0_181 58.19/27.89 java.vendor=Oracle Corporation 58.19/27.89 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 58.19/27.89 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 58.19/27.89 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 58.19/27.89 58.19/27.89 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:50:39.740 58.19/27.89 !MESSAGE The workspace will exit with unsaved changes in this session. 58.19/27.89 Received shutdown request... 58.19/27.89 Ultimate: 58.19/27.89 GTK+ Version Check 58.19/27.89 EOF