./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i -s /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/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 15362e3354379e86b7768de02eb760f50ed72879 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 11:02:00,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:02:00,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:02:00,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:02:00,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:02:00,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:02:00,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:02:00,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:02:00,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:02:00,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:02:00,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:02:00,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:02:00,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:02:00,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:02:00,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:02:00,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:02:00,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:02:00,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:02:00,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:02:00,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:02:00,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:02:00,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:02:00,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:02:00,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:02:00,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:02:00,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:02:00,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:02:00,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:02:00,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:02:00,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:02:00,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:02:00,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:02:00,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:02:00,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:02:00,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:02:00,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:02:00,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:02:00,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:02:00,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:02:00,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:02:00,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:02:00,994 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:02:01,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:02:01,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:02:01,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:02:01,005 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:02:01,005 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:02:01,005 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:02:01,005 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:02:01,005 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:02:01,006 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:02:01,006 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:02:01,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:02:01,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:02:01,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:02:01,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:02:01,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:02:01,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:02:01,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:02:01,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:02:01,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:02:01,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:02:01,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:02:01,010 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:02:01,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:02:01,010 INFO L138 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/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/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 -> 15362e3354379e86b7768de02eb760f50ed72879 [2019-12-07 11:02:01,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:02:01,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:02:01,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:02:01,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:02:01,123 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:02:01,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2019-12-07 11:02:01,167 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/data/42194386b/0464e3044db748fb8a0a7c5eb64235fb/FLAG58b35024a [2019-12-07 11:02:01,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:02:01,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2019-12-07 11:02:01,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/data/42194386b/0464e3044db748fb8a0a7c5eb64235fb/FLAG58b35024a [2019-12-07 11:02:01,514 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/data/42194386b/0464e3044db748fb8a0a7c5eb64235fb [2019-12-07 11:02:01,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:02:01,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:02:01,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:01,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:02:01,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:02:01,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01, skipping insertion in model container [2019-12-07 11:02:01,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:02:01,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:02:01,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:01,763 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:02:01,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:01,826 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:02:01,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01 WrapperNode [2019-12-07 11:02:01,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:01,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:01,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:02:01,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:02:01,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:01,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:02:01,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:02:01,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:02:01,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... [2019-12-07 11:02:01,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:02:01,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:02:01,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:02:01,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:02:01,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/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 [2019-12-07 11:02:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:02:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:02:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:02:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:02:01,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:02:01,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:02:02,130 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:02:02,130 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 11:02:02,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:02 BoogieIcfgContainer [2019-12-07 11:02:02,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:02:02,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:02:02,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:02:02,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:02:02,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:02:01" (1/3) ... [2019-12-07 11:02:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6177484d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:02, skipping insertion in model container [2019-12-07 11:02:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:01" (2/3) ... [2019-12-07 11:02:02,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6177484d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:02, skipping insertion in model container [2019-12-07 11:02:02,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:02" (3/3) ... [2019-12-07 11:02:02,138 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2019-12-07 11:02:02,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:02:02,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 11:02:02,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 11:02:02,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:02:02,169 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:02:02,169 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:02:02,169 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:02:02,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:02:02,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:02:02,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:02:02,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:02:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-12-07 11:02:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:02:02,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:02:02,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 97607, now seen corresponding path program 1 times [2019-12-07 11:02:02,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439827726] [2019-12-07 11:02:02,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439827726] [2019-12-07 11:02:02,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:02,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:02:02,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296896302] [2019-12-07 11:02:02,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:02,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:02,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:02,312 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-12-07 11:02:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:02,337 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 11:02:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:02,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:02:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:02,344 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:02:02,344 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 11:02:02,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 11:02:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 11:02:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:02:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 11:02:02,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 3 [2019-12-07 11:02:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:02,365 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 11:02:02,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-12-07 11:02:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:02:02,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:02:02,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash 97608, now seen corresponding path program 1 times [2019-12-07 11:02:02,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980825085] [2019-12-07 11:02:02,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980825085] [2019-12-07 11:02:02,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:02,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:02,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467935627] [2019-12-07 11:02:02,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:02,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:02,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:02,408 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2019-12-07 11:02:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:02,448 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-12-07 11:02:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:02,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 11:02:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:02,449 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:02:02,450 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 11:02:02,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 11:02:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2019-12-07 11:02:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:02:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-12-07 11:02:02,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 3 [2019-12-07 11:02:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:02,453 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 11:02:02,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-12-07 11:02:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:02:02,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:02:02,454 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash 99291, now seen corresponding path program 1 times [2019-12-07 11:02:02,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929544967] [2019-12-07 11:02:02,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929544967] [2019-12-07 11:02:02,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:02,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:02:02,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459601316] [2019-12-07 11:02:02,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:02,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:02,481 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-12-07 11:02:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:02,491 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-12-07 11:02:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:02,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:02:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:02,492 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:02:02,492 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:02:02,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:02:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:02:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:02:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-12-07 11:02:02,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 3 [2019-12-07 11:02:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:02,495 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-12-07 11:02:02,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-12-07 11:02:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:02:02,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:02:02,496 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash 3079237, now seen corresponding path program 1 times [2019-12-07 11:02:02,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099889561] [2019-12-07 11:02:02,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099889561] [2019-12-07 11:02:02,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:02,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:02,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249040133] [2019-12-07 11:02:02,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:02,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:02,516 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-12-07 11:02:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:02,529 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-12-07 11:02:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:02,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 11:02:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:02,529 INFO L225 Difference]: With dead ends: 19 [2019-12-07 11:02:02,529 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 11:02:02,530 INFO L630 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 [2019-12-07 11:02:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 11:02:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 11:02:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 11:02:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 11:02:02,532 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 4 [2019-12-07 11:02:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:02,532 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 11:02:02,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-12-07 11:02:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:02:02,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:02:02,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 3079238, now seen corresponding path program 1 times [2019-12-07 11:02:02,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668988676] [2019-12-07 11:02:02,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668988676] [2019-12-07 11:02:02,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:02,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:02,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018954711] [2019-12-07 11:02:02,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:02,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:02,561 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-12-07 11:02:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:02,583 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-12-07 11:02:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:02,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 11:02:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:02,584 INFO L225 Difference]: With dead ends: 30 [2019-12-07 11:02:02,584 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 11:02:02,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 11:02:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2019-12-07 11:02:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:02:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-12-07 11:02:02,587 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2019-12-07 11:02:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:02,587 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-12-07 11:02:02,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-12-07 11:02:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:02:02,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:02,587 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 11:02:02,588 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 93846041, now seen corresponding path program 1 times [2019-12-07 11:02:02,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:02,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260465519] [2019-12-07 11:02:02,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260465519] [2019-12-07 11:02:02,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252577164] [2019-12-07 11:02:02,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:02,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:02:02,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:02,698 INFO L377 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 [2019-12-07 11:02:02,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:02:02,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:02:02,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:02:02,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 11:02:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,721 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:02:02,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:02,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [329875689] [2019-12-07 11:02:02,781 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 11:02:02,781 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:02:02,785 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:02:02,789 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:02:02,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:02:03,050 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:02:03,270 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-07 11:02:03,321 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:02:03,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:02:03,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 11:02:03,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924030961] [2019-12-07 11:02:03,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:02:03,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:02:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:02:03,322 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2019-12-07 11:02:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:03,415 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 11:02:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:02:03,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 11:02:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:03,416 INFO L225 Difference]: With dead ends: 48 [2019-12-07 11:02:03,416 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 11:02:03,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:02:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 11:02:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 17. [2019-12-07 11:02:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 11:02:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 11:02:03,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 5 [2019-12-07 11:02:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:03,419 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 11:02:03,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:02:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 11:02:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 11:02:03,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:03,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:02:03,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:03,621 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1335820097, now seen corresponding path program 1 times [2019-12-07 11:02:03,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:03,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304724923] [2019-12-07 11:02:03,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:03,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304724923] [2019-12-07 11:02:03,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:03,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:03,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25924793] [2019-12-07 11:02:03,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:02:03,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:02:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:03,761 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-12-07 11:02:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:03,809 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-12-07 11:02:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:02:03,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-07 11:02:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:03,810 INFO L225 Difference]: With dead ends: 31 [2019-12-07 11:02:03,810 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 11:02:03,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 11:02:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2019-12-07 11:02:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 11:02:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-12-07 11:02:03,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2019-12-07 11:02:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:03,814 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 11:02:03,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:02:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-12-07 11:02:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:02:03,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:03,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:03,814 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1539248857, now seen corresponding path program 1 times [2019-12-07 11:02:03,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:03,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704713354] [2019-12-07 11:02:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:03,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704713354] [2019-12-07 11:02:03,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:03,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:02:03,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009093260] [2019-12-07 11:02:03,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:02:03,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:02:03,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:02:03,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:02:03,838 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-12-07 11:02:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:03,848 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-12-07 11:02:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:02:03,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:02:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:03,849 INFO L225 Difference]: With dead ends: 20 [2019-12-07 11:02:03,849 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 11:02:03,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 11:02:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 11:02:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 11:02:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-12-07 11:02:03,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2019-12-07 11:02:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:03,852 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-12-07 11:02:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:02:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-12-07 11:02:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:02:03,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:03,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:02:03,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 11:02:03,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash -204994994, now seen corresponding path program 1 times [2019-12-07 11:02:03,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:02:03,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838533529] [2019-12-07 11:02:03,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:02:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:02:03,893 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:02:03,894 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:02:03,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:02:03 BoogieIcfgContainer [2019-12-07 11:02:03,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:02:03,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:02:03,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:02:03,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:02:03,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:02" (3/4) ... [2019-12-07 11:02:03,912 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:02:03,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_393ae9ad-a7be-493a-889a-17b478cf9d50/bin/utaipan/witness.graphml [2019-12-07 11:02:03,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:02:03,943 INFO L168 Benchmark]: Toolchain (without parser) took 2426.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 937.1 MB in the beginning and 1.0 GB in the end (delta: -102.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:02:03,943 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:02:03,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:03,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.56 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. [2019-12-07 11:02:03,944 INFO L168 Benchmark]: Boogie Preprocessor took 17.61 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:03,944 INFO L168 Benchmark]: RCFGBuilder took 258.17 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:03,944 INFO L168 Benchmark]: TraceAbstraction took 1777.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:03,945 INFO L168 Benchmark]: Witness Printer took 31.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:02:03,946 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.56 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. * Boogie Preprocessor took 17.61 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.17 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1777.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Witness Printer took 31.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 532]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L515] int length = __VERIFIER_nondet_int(); [L516] COND FALSE !(length < 1) [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; [L521] COND TRUE i < length - 1 [L523] nondetString[i] = __VERIFIER_nondet_char() [L521] i++ [L521] COND FALSE !(i < length - 1) [L526] nondetString[length-1] = '\0' [L527] return nondetString; [L537] char* p = build_nondet_String(); [L531] const char *p = s; [L532] EXPR \read(*p) [L532] COND TRUE *p != '\0' [L533] p = p+2 [L532] \read(*p) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 10 error locations. Result: UNSAFE, OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 117 SDtfs, 220 SDslu, 117 SDs, 0 SdLazy, 142 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317 SizeOfPredicates, 3 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...