./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 693983fd65e20b5d89b8cfa65a19d47075cafd63 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:58:03,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:58:03,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:58:03,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:58:03,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:58:03,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:58:03,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:58:03,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:58:03,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:58:03,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:58:03,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:58:03,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:58:03,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:58:03,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:58:03,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:58:03,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:58:03,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:58:03,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:58:03,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:58:03,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:58:03,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:58:03,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:58:03,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:58:03,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:58:03,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:58:03,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:58:03,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:58:03,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:58:03,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:58:03,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:58:03,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:58:03,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:58:03,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:58:03,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:58:03,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:58:03,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:58:03,225 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 01:58:03,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:58:03,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:58:03,233 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:58:03,233 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:58:03,233 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:58:03,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:58:03,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 01:58:03,234 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:58:03,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:58:03,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:58:03,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:58:03,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:58:03,236 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 693983fd65e20b5d89b8cfa65a19d47075cafd63 [2018-12-02 01:58:03,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:58:03,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:58:03,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:58:03,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:58:03,263 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:58:03,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:58:03,299 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/data/557c385d8/740bec0cd1d642c09fa9ab7f53a934ab/FLAG0654a331a [2018-12-02 01:58:03,767 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:58:03,768 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:58:03,773 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/data/557c385d8/740bec0cd1d642c09fa9ab7f53a934ab/FLAG0654a331a [2018-12-02 01:58:03,781 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/data/557c385d8/740bec0cd1d642c09fa9ab7f53a934ab [2018-12-02 01:58:03,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:58:03,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:58:03,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:58:03,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:58:03,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:58:03,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:58:03" (1/1) ... [2018-12-02 01:58:03,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac4e85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:03, skipping insertion in model container [2018-12-02 01:58:03,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:58:03" (1/1) ... [2018-12-02 01:58:03,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:58:03,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:58:03,945 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:58:03,951 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:58:04,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:58:04,027 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:58:04,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04 WrapperNode [2018-12-02 01:58:04,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:58:04,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:58:04,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:58:04,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:58:04,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:58:04,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:58:04,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:58:04,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:58:04,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... [2018-12-02 01:58:04,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:58:04,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:58:04,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:58:04,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:58:04,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:58:04,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:58:04,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:58:04,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:58:04,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:58:04,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:58:04,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:58:04,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:58:04,095 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2018-12-02 01:58:04,095 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-12-02 01:58:04,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:58:04,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:58:04,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:58:04,208 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:58:04,209 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 01:58:04,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:58:04 BoogieIcfgContainer [2018-12-02 01:58:04,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:58:04,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:58:04,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:58:04,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:58:04,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:58:03" (1/3) ... [2018-12-02 01:58:04,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3747f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:58:04, skipping insertion in model container [2018-12-02 01:58:04,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:58:04" (2/3) ... [2018-12-02 01:58:04,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3747f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:58:04, skipping insertion in model container [2018-12-02 01:58:04,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:58:04" (3/3) ... [2018-12-02 01:58:04,214 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-02 01:58:04,220 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:58:04,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-02 01:58:04,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-02 01:58:04,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:58:04,250 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 01:58:04,250 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:58:04,250 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:58:04,250 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:58:04,250 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:58:04,250 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:58:04,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:58:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 01:58:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 01:58:04,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 103515181, now seen corresponding path program 1 times [2018-12-02 01:58:04,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:58:04,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:04,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:58:04,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:58:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:58:04,378 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-12-02 01:58:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:04,402 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-12-02 01:58:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:58:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-02 01:58:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:04,409 INFO L225 Difference]: With dead ends: 26 [2018-12-02 01:58:04,409 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 01:58:04,410 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 [2018-12-02 01:58:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 01:58:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 01:58:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 01:58:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 01:58:04,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 9 [2018-12-02 01:58:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:04,430 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 01:58:04,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:58:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-02 01:58:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 01:58:04,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 103515182, now seen corresponding path program 1 times [2018-12-02 01:58:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:04,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:58:04,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:04,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:58:04,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:58:04,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:58:04,463 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 4 states. [2018-12-02 01:58:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:04,483 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-12-02 01:58:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:58:04,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-02 01:58:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:04,485 INFO L225 Difference]: With dead ends: 22 [2018-12-02 01:58:04,485 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 01:58:04,485 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 [2018-12-02 01:58:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 01:58:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 01:58:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 01:58:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-02 01:58:04,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 9 [2018-12-02 01:58:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:04,487 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-02 01:58:04,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:58:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-02 01:58:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 01:58:04,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 34250244, now seen corresponding path program 1 times [2018-12-02 01:58:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:04,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:58:04,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:04,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:58:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:58:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:58:04,519 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-12-02 01:58:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:04,553 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-02 01:58:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:58:04,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-02 01:58:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:04,553 INFO L225 Difference]: With dead ends: 21 [2018-12-02 01:58:04,554 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 01:58:04,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:58:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 01:58:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 01:58:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 01:58:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 01:58:04,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2018-12-02 01:58:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:04,556 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 01:58:04,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:58:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-02 01:58:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 01:58:04,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash 34250245, now seen corresponding path program 1 times [2018-12-02 01:58:04,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:04,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:58:04,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:04,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:58:04,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:58:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:58:04,603 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-12-02 01:58:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:04,636 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-02 01:58:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:58:04,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-02 01:58:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:04,637 INFO L225 Difference]: With dead ends: 27 [2018-12-02 01:58:04,638 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 01:58:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:58:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 01:58:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-12-02 01:58:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 01:58:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-02 01:58:04,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2018-12-02 01:58:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:04,640 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-02 01:58:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:58:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-02 01:58:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 01:58:04,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,641 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1853214269, now seen corresponding path program 1 times [2018-12-02 01:58:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:04,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:58:04,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:04,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:58:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:58:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:58:04,725 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-12-02 01:58:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:04,777 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-02 01:58:04,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:58:04,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 01:58:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:04,778 INFO L225 Difference]: With dead ends: 34 [2018-12-02 01:58:04,778 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 01:58:04,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:58:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 01:58:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-02 01:58:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 01:58:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-02 01:58:04,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 15 [2018-12-02 01:58:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:04,781 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-02 01:58:04,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:58:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-02 01:58:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 01:58:04,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:04,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:04,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:04,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1173155899, now seen corresponding path program 1 times [2018-12-02 01:58:04,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:04,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:04,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:04,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:58:04,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:58:04,892 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-02 01:58:04,893 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [15], [24], [29], [31], [32], [39], [40], [41], [43] [2018-12-02 01:58:04,912 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:58:04,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:58:05,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:58:05,025 INFO L272 AbstractInterpreter]: Visited 15 different actions 27 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 182 root evaluator evaluations with a maximum evaluation depth of 3. Performed 182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-12-02 01:58:05,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:05,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:58:05,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:58:05,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:58:05,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:05,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:58:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:05,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:58:05,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:58:05,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 01:58:05,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,090 INFO L267 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. [2018-12-02 01:58:05,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 01:58:05,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 01:58:05,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 01:58:05,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:58:05,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:58:05,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:58:05,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 01:58:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:05,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:58:05,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 01:58:05,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 01:58:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 01:58:05,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 01:58:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:05,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:58:05,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2018-12-02 01:58:05,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:58:05,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 01:58:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 01:58:05,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:58:05,404 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-02 01:58:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:05,700 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-12-02 01:58:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:58:05,701 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-02 01:58:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:05,701 INFO L225 Difference]: With dead ends: 42 [2018-12-02 01:58:05,701 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 01:58:05,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-12-02 01:58:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 01:58:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-12-02 01:58:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 01:58:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-02 01:58:05,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2018-12-02 01:58:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:05,705 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-02 01:58:05,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 01:58:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-02 01:58:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 01:58:05,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:05,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:05,706 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:05,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1649828283, now seen corresponding path program 1 times [2018-12-02 01:58:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:05,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:58:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:58:05,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:58:05,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:58:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:58:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:58:05,739 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 4 states. [2018-12-02 01:58:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:05,753 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-02 01:58:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:58:05,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 01:58:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:05,754 INFO L225 Difference]: With dead ends: 33 [2018-12-02 01:58:05,754 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 01:58:05,754 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 [2018-12-02 01:58:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 01:58:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 01:58:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 01:58:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-02 01:58:05,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2018-12-02 01:58:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:05,756 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-02 01:58:05,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:58:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-02 01:58:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 01:58:05,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:58:05,756 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:58:05,756 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 01:58:05,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:58:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1338546173, now seen corresponding path program 2 times [2018-12-02 01:58:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:58:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:58:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:58:05,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:58:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:58:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:05,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:58:05,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:58:05,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 01:58:05,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 01:58:05,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:58:05,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:58:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:58:05,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 01:58:05,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 01:58:05,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:58:05,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:58:05,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 01:58:05,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 01:58:05,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:58:05,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 01:58:05,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:05,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 01:58:06,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 01:58:06,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 01:58:06,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 01:58:06,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:58:06,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:58:06,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-02 01:58:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:06,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:58:06,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-12-02 01:58:06,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 01:58:06,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:06,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:06,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-02 01:58:06,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 01:58:06,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:58:06,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:58:06,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:58:06,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-12-02 01:58:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:58:06,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:58:06,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2018-12-02 01:58:06,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:58:06,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:58:06,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:58:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-02 01:58:06,390 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-12-02 01:58:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:58:06,747 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-02 01:58:06,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:58:06,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-12-02 01:58:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:58:06,747 INFO L225 Difference]: With dead ends: 20 [2018-12-02 01:58:06,747 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 01:58:06,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 01:58:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 01:58:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 01:58:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 01:58:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 01:58:06,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-02 01:58:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:58:06,749 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:58:06,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:58:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:58:06,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 01:58:06,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:58:06 BoogieIcfgContainer [2018-12-02 01:58:06,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:58:06,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:58:06,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:58:06,753 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:58:06,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:58:04" (3/4) ... [2018-12-02 01:58:06,755 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 01:58:06,758 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 01:58:06,758 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2018-12-02 01:58:06,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 01:58:06,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 01:58:06,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 01:58:06,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 01:58:06,783 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_55d39b10-3fd6-48bb-9d24-dca38ec0f31a/bin-2019/utaipan/witness.graphml [2018-12-02 01:58:06,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:58:06,784 INFO L168 Benchmark]: Toolchain (without parser) took 3000.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 847.8 MB in the end (delta: 99.2 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,785 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:58:06,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,785 INFO L168 Benchmark]: Boogie Preprocessor took 16.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:58:06,786 INFO L168 Benchmark]: RCFGBuilder took 146.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,786 INFO L168 Benchmark]: TraceAbstraction took 2542.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 851.2 MB in the end (delta: 234.4 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,786 INFO L168 Benchmark]: Witness Printer took 30.92 ms. Allocated memory is still 1.1 GB. Free memory was 851.2 MB in the beginning and 847.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:58:06,788 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2542.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 851.2 MB in the end (delta: 234.4 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. * Witness Printer took 30.92 ms. Allocated memory is still 1.1 GB. Free memory was 851.2 MB in the beginning and 847.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 5 error locations. SAFE Result, 2.5s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 137 SDslu, 395 SDs, 0 SdLazy, 385 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 15 QuantifiedInterpolants, 20818 SizeOfPredicates, 22 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 2/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...