./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe_false-valid-deref.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_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/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 b1c981e5c0ba7a15ac143c5240d22ecf11476d0a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:32:57,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:32:57,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:32:57,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:32:57,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:32:57,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:32:57,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:32:57,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:32:57,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:32:57,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:32:57,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:32:57,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:32:57,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:32:57,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:32:57,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:32:57,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:32:57,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:32:57,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:32:57,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:32:57,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:32:57,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:32:57,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:32:57,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:32:57,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:32:57,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:32:57,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:32:57,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:32:57,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:32:57,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:32:57,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:32:57,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:32:57,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:32:57,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:32:57,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:32:57,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:32:57,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:32:57,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 12:32:57,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:32:57,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:32:57,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:32:57,121 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:32:57,121 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:32:57,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:32:57,121 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:32:57,122 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:32:57,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:32:57,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:32:57,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:32:57,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:32:57,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:32:57,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:32:57,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:32:57,125 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:32:57,125 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:32:57,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:32:57,125 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_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/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 -> b1c981e5c0ba7a15ac143c5240d22ecf11476d0a [2018-12-09 12:32:57,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:32:57,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:32:57,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:32:57,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:32:57,157 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:32:57,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-12-09 12:32:57,192 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/data/b2c495d3e/77841e0ab7d0480db79581eeb8853802/FLAG243ce7482 [2018-12-09 12:32:57,597 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:32:57,598 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/sv-benchmarks/c/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-12-09 12:32:57,603 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/data/b2c495d3e/77841e0ab7d0480db79581eeb8853802/FLAG243ce7482 [2018-12-09 12:32:57,611 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/data/b2c495d3e/77841e0ab7d0480db79581eeb8853802 [2018-12-09 12:32:57,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:32:57,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:32:57,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:32:57,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:32:57,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:32:57,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f79a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57, skipping insertion in model container [2018-12-09 12:32:57,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:32:57,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:32:57,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:32:57,785 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:32:57,853 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:32:57,872 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:32:57,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57 WrapperNode [2018-12-09 12:32:57,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:32:57,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:32:57,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:32:57,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:32:57,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:32:57,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:32:57,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:32:57,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:32:57,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... [2018-12-09 12:32:57,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:32:57,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:32:57,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:32:57,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:32:57,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/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-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2018-12-09 12:32:57,939 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-12-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-12-09 12:32:57,939 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-12-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:32:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:32:57,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:32:57,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:32:57,940 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:32:57,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:32:57,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:32:57,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:32:58,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:32:58,091 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 12:32:58,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:58 BoogieIcfgContainer [2018-12-09 12:32:58,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:32:58,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:32:58,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:32:58,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:32:58,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:32:57" (1/3) ... [2018-12-09 12:32:58,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d6252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:58, skipping insertion in model container [2018-12-09 12:32:58,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:57" (2/3) ... [2018-12-09 12:32:58,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d6252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:58, skipping insertion in model container [2018-12-09 12:32:58,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:58" (3/3) ... [2018-12-09 12:32:58,098 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-12-09 12:32:58,106 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:32:58,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-09 12:32:58,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-09 12:32:58,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:32:58,144 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 12:32:58,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:32:58,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:32:58,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:32:58,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:32:58,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:32:58,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:32:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-09 12:32:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 12:32:58,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 70283880, now seen corresponding path program 1 times [2018-12-09 12:32:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,277 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-09 12:32:58,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:32:58,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:58,291 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-12-09 12:32:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,325 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-09 12:32:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:58,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 12:32:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,335 INFO L225 Difference]: With dead ends: 47 [2018-12-09 12:32:58,335 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 12:32:58,336 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-09 12:32:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 12:32:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 12:32:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 12:32:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-09 12:32:58,363 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 10 [2018-12-09 12:32:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,363 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-09 12:32:58,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-09 12:32:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 12:32:58,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 70283881, now seen corresponding path program 1 times [2018-12-09 12:32:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,400 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-09 12:32:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:58,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:32:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:32:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:32:58,401 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2018-12-09 12:32:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,413 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-09 12:32:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:32:58,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 12:32:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,414 INFO L225 Difference]: With dead ends: 43 [2018-12-09 12:32:58,414 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 12:32:58,414 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-09 12:32:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 12:32:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 12:32:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 12:32:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 12:32:58,417 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 10 [2018-12-09 12:32:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,417 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 12:32:58,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:32:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 12:32:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 12:32:58,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,418 INFO L423 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1441848986, now seen corresponding path program 1 times [2018-12-09 12:32:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,469 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-09 12:32:58,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:32:58,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:32:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:32:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:32:58,470 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2018-12-09 12:32:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,555 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-09 12:32:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:32:58,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 12:32:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,556 INFO L225 Difference]: With dead ends: 39 [2018-12-09 12:32:58,556 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 12:32:58,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 12:32:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 12:32:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 12:32:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-09 12:32:58,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 17 [2018-12-09 12:32:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,559 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-09 12:32:58,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:32:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-09 12:32:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 12:32:58,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1441848987, now seen corresponding path program 1 times [2018-12-09 12:32:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,632 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-09 12:32:58,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:32:58,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:32:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:32:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:32:58,633 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-12-09 12:32:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,729 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-12-09 12:32:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:32:58,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-12-09 12:32:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,731 INFO L225 Difference]: With dead ends: 49 [2018-12-09 12:32:58,731 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 12:32:58,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:32:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 12:32:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-09 12:32:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 12:32:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 12:32:58,737 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 17 [2018-12-09 12:32:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,737 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 12:32:58,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:32:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 12:32:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 12:32:58,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,738 INFO L423 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 516418290, now seen corresponding path program 1 times [2018-12-09 12:32:58,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,764 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-09 12:32:58,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:32:58,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:32:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:32:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:58,765 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2018-12-09 12:32:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:58,771 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-12-09 12:32:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:32:58,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 12:32:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:58,772 INFO L225 Difference]: With dead ends: 47 [2018-12-09 12:32:58,772 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 12:32:58,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:32:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 12:32:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 12:32:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 12:32:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-12-09 12:32:58,776 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-12-09 12:32:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:58,776 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-12-09 12:32:58,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:32:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-12-09 12:32:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:58,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:58,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:58,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:58,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1944089649, now seen corresponding path program 1 times [2018-12-09 12:32:58,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:58,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:58,896 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-09 12:32:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:32:58,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 12:32:58,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:32:58,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:32:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:32:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:32:58,898 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 12 states. [2018-12-09 12:32:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:32:59,025 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-09 12:32:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:32:59,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-09 12:32:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:32:59,026 INFO L225 Difference]: With dead ends: 72 [2018-12-09 12:32:59,026 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 12:32:59,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:32:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 12:32:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-12-09 12:32:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 12:32:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-12-09 12:32:59,029 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2018-12-09 12:32:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:32:59,029 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-12-09 12:32:59,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:32:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-12-09 12:32:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 12:32:59,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:32:59,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:32:59,030 INFO L423 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:32:59,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1329809293, now seen corresponding path program 1 times [2018-12-09 12:32:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:32:59,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:59,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:32:59,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:32:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:59,197 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-09 12:32:59,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:32:59,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 12:32:59,199 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 12:32:59,200 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [8], [11], [12], [13], [18], [20], [21], [24], [25], [28], [36], [51], [52], [57], [69], [70], [71], [73], [74], [75] [2018-12-09 12:32:59,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 12:32:59,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 12:32:59,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 12:32:59,368 INFO L272 AbstractInterpreter]: Visited 23 different actions 37 times. Merged at 7 different actions 14 times. Never widened. Performed 296 root evaluator evaluations with a maximum evaluation depth of 5. Performed 296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-09 12:32:59,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:32:59,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 12:32:59,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:32:59,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/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-09 12:32:59,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:32:59,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 12:32:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:32:59,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:32:59,428 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-09 12:32:59,430 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-09 12:32:59,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 12:32:59,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:32:59,439 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-09 12:32:59,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 12:32:59,603 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-09 12:32:59,609 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-09 12:32:59,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 12:32:59,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 12:32:59,621 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-09 12:32:59,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 12:32:59,717 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-09 12:32:59,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 12:33:00,059 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-09 12:33:00,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 12:33:00,067 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-09 12:33:00,075 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-09 12:33:00,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 12:33:00,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 12:33:00,080 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-09 12:33:00,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 12:33:00,086 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-09 12:33:00,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 12:33:00,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2018-12-09 12:33:00,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 12:33:00,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 12:33:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 12:33:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 12:33:00,101 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 23 states. [2018-12-09 12:33:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:33:01,459 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-12-09 12:33:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:33:01,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-09 12:33:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:33:01,460 INFO L225 Difference]: With dead ends: 93 [2018-12-09 12:33:01,460 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 12:33:01,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 12:33:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 12:33:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-12-09 12:33:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 12:33:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-12-09 12:33:01,464 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 23 [2018-12-09 12:33:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:33:01,464 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-12-09 12:33:01,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 12:33:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-12-09 12:33:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:33:01,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:33:01,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:33:01,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:33:01,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:33:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1418412234, now seen corresponding path program 1 times [2018-12-09 12:33:01,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:33:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:33:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:33:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:01,505 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-09 12:33:01,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:33:01,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:33:01,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:33:01,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:33:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:33:01,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:33:01,506 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-12-09 12:33:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:33:01,577 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-12-09 12:33:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:33:01,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-09 12:33:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:33:01,578 INFO L225 Difference]: With dead ends: 78 [2018-12-09 12:33:01,578 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 12:33:01,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:33:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 12:33:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-09 12:33:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 12:33:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-09 12:33:01,582 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2018-12-09 12:33:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:33:01,582 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-09 12:33:01,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:33:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-09 12:33:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:33:01,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:33:01,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:33:01,584 INFO L423 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:33:01,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:33:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1418412233, now seen corresponding path program 1 times [2018-12-09 12:33:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:33:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:33:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:33:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:33:01,670 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-09 12:33:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:33:01,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:33:01,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:33:01,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:33:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:33:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:33:01,671 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 11 states. [2018-12-09 12:33:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:33:01,766 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-12-09 12:33:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:33:01,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-12-09 12:33:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:33:01,767 INFO L225 Difference]: With dead ends: 88 [2018-12-09 12:33:01,767 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 12:33:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:33:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 12:33:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-09 12:33:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 12:33:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-09 12:33:01,771 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 26 [2018-12-09 12:33:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:33:01,771 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-09 12:33:01,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:33:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-09 12:33:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:33:01,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:33:01,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:33:01,771 INFO L423 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 12:33:01,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:33:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1416565192, now seen corresponding path program 1 times [2018-12-09 12:33:01,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:33:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:33:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:33:01,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:33:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:33:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:33:01,795 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:33:01,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:33:01 BoogieIcfgContainer [2018-12-09 12:33:01,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:33:01,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:33:01,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:33:01,813 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:33:01,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:58" (3/4) ... [2018-12-09 12:33:01,815 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:33:01,840 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b4d3e8fc-1bdc-46f0-9079-9845ad47cd78/bin-2019/utaipan/witness.graphml [2018-12-09 12:33:01,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:33:01,841 INFO L168 Benchmark]: Toolchain (without parser) took 4227.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 948.1 MB in the beginning and 911.2 MB in the end (delta: 36.9 MB). Peak memory consumption was 265.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:33:01,841 INFO L168 Benchmark]: CDTParser took 0.13 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-09 12:33:01,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:33:01,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:33:01,842 INFO L168 Benchmark]: Boogie Preprocessor took 16.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:33:01,842 INFO L168 Benchmark]: RCFGBuilder took 184.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:33:01,842 INFO L168 Benchmark]: TraceAbstraction took 3720.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 198.2 MB). Peak memory consumption was 278.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:33:01,843 INFO L168 Benchmark]: Witness Printer took 27.30 ms. Allocated memory is still 1.3 GB. Free memory is still 911.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:33:01,844 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.13 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 258.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 184.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3720.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 911.2 MB in the end (delta: 198.2 MB). Peak memory consumption was 278.4 MB. Max. memory is 11.5 GB. * Witness Printer took 27.30 ms. Allocated memory is still 1.3 GB. Free memory is still 911.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 557]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L546] nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L547] return nondetString; VAL [\result={4:0}, length=1, malloc(length * sizeof(char))={4:0}, nondetString={4:0}] [L556] RET, EXPR build_nondet_String() VAL [build_nondet_String()={4:0}] [L556] char* s = build_nondet_String(); [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={4:0}] [L551] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={4:0}, s={4:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={4:0}, s={4:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) [L553] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={4:0}, s={4:0}] [L553] EXPR (*s == c) ? (char *) s : 0 VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={4:0}, s={4:0}] [L553] return ( (*s == c) ? (char *) s : 0 ); [L557] RET cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 13 error locations. UNSAFE Result, 3.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 289 SDtfs, 389 SDslu, 1320 SDs, 0 SdLazy, 1275 SolverSat, 42 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=9, 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, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 208 ConstructedInterpolants, 13 QuantifiedInterpolants, 26407 SizeOfPredicates, 13 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 2/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...