./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.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_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/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 1ea2dc862d4e5ac3143824817093a58b58ef1480 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:56:43,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:56:43,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:56:43,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:56:43,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:56:43,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:56:43,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:56:43,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:56:43,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:56:43,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:56:43,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:56:43,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:56:43,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:56:43,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:56:43,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:56:43,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:56:43,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:56:43,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:56:43,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:56:43,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:56:43,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:56:43,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:56:43,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:56:43,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:56:43,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:56:43,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:56:43,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:56:43,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:56:43,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:56:43,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:56:43,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:56:43,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:56:43,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:56:43,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:56:43,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:56:43,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:56:43,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:56:43,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:56:43,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:56:43,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:56:43,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:56:43,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 11:56:43,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:56:43,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:56:43,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:56:43,665 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:56:43,665 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:56:43,665 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:56:43,666 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:56:43,666 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:56:43,667 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:56:43,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:56:43,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:56:43,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:56:43,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:56:43,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:56:43,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:56:43,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:56:43,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:56:43,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:56:43,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:56:43,669 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_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/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 -> 1ea2dc862d4e5ac3143824817093a58b58ef1480 [2019-12-07 11:56:43,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:56:43,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:56:43,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:56:43,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:56:43,781 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:56:43,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-12-07 11:56:43,825 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/data/ff86ce64e/8ed147696bf44ce2ab2a81cc4e1d3406/FLAG8d4e7f8eb [2019-12-07 11:56:44,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:56:44,290 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2019-12-07 11:56:44,299 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/data/ff86ce64e/8ed147696bf44ce2ab2a81cc4e1d3406/FLAG8d4e7f8eb [2019-12-07 11:56:44,307 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/data/ff86ce64e/8ed147696bf44ce2ab2a81cc4e1d3406 [2019-12-07 11:56:44,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:56:44,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:56:44,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:56:44,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:56:44,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:56:44,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dd141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44, skipping insertion in model container [2019-12-07 11:56:44,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:56:44,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:56:44,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:56:44,545 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:56:44,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:56:44,604 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:56:44,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44 WrapperNode [2019-12-07 11:56:44,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:56:44,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:56:44,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:56:44,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:56:44,611 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:56:44" (1/1) ... [2019-12-07 11:56:44,620 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:56:44" (1/1) ... [2019-12-07 11:56:44,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:56:44,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:56:44,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:56:44,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:56:44,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... [2019-12-07 11:56:44,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:56:44,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:56:44,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:56:44,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:56:44,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/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:56:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:56:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:56:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:56:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:56:44,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:56:44,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:56:44,911 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:56:44,911 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 11:56:44,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:44 BoogieIcfgContainer [2019-12-07 11:56:44,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:56:44,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:56:44,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:56:44,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:56:44,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:56:44" (1/3) ... [2019-12-07 11:56:44,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4577f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:56:44, skipping insertion in model container [2019-12-07 11:56:44,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:56:44" (2/3) ... [2019-12-07 11:56:44,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4577f5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:56:44, skipping insertion in model container [2019-12-07 11:56:44,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:44" (3/3) ... [2019-12-07 11:56:44,916 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2019-12-07 11:56:44,923 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:56:44,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-12-07 11:56:44,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-12-07 11:56:44,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:56:44,946 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:56:44,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:56:44,946 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:56:44,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:56:44,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:56:44,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:56:44,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:56:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 11:56:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 11:56:44,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:44,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 11:56:44,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash 3678261, now seen corresponding path program 1 times [2019-12-07 11:56:44,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:44,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670169030] [2019-12-07 11:56:44,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,046 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:56:45,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670169030] [2019-12-07 11:56:45,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:45,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564672155] [2019-12-07 11:56:45,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:56:45,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:56:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:56:45,061 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-12-07 11:56:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,071 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-12-07 11:56:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:56:45,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 11:56:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,077 INFO L225 Difference]: With dead ends: 47 [2019-12-07 11:56:45,078 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 11:56:45,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:56:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 11:56:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 11:56:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 11:56:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-12-07 11:56:45,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 4 [2019-12-07 11:56:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,101 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-12-07 11:56:45,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:56:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-12-07 11:56:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:56:45,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:45,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash 113811744, now seen corresponding path program 1 times [2019-12-07 11:56:45,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698668158] [2019-12-07 11:56:45,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,140 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:56:45,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698668158] [2019-12-07 11:56:45,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:45,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956194071] [2019-12-07 11:56:45,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:45,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:45,142 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2019-12-07 11:56:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,176 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-12-07 11:56:45,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:45,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:56:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,177 INFO L225 Difference]: With dead ends: 45 [2019-12-07 11:56:45,178 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 11:56:45,178 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:56:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 11:56:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 11:56:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:56:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-12-07 11:56:45,184 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 5 [2019-12-07 11:56:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,184 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-12-07 11:56:45,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-12-07 11:56:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:56:45,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:45,185 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 113811745, now seen corresponding path program 1 times [2019-12-07 11:56:45,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631162632] [2019-12-07 11:56:45,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,228 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:56:45,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631162632] [2019-12-07 11:56:45,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:45,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933335755] [2019-12-07 11:56:45,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:45,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:45,230 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-12-07 11:56:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,266 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-12-07 11:56:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:45,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 11:56:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,267 INFO L225 Difference]: With dead ends: 44 [2019-12-07 11:56:45,267 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 11:56:45,268 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:56:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 11:56:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 11:56:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 11:56:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-12-07 11:56:45,271 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 5 [2019-12-07 11:56:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,271 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-12-07 11:56:45,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-12-07 11:56:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:56:45,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:45,272 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1998977518, now seen corresponding path program 1 times [2019-12-07 11:56:45,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849754238] [2019-12-07 11:56:45,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,309 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:56:45,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849754238] [2019-12-07 11:56:45,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:45,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251508019] [2019-12-07 11:56:45,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:45,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:45,310 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-12-07 11:56:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,334 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-12-07 11:56:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:45,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 11:56:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,335 INFO L225 Difference]: With dead ends: 41 [2019-12-07 11:56:45,335 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:56:45,335 INFO L630 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 [2019-12-07 11:56:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:56:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 11:56:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:56:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 11:56:45,338 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2019-12-07 11:56:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,338 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 11:56:45,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 11:56:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:56:45,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:45,339 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1998977519, now seen corresponding path program 1 times [2019-12-07 11:56:45,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141587657] [2019-12-07 11:56:45,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,402 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:56:45,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141587657] [2019-12-07 11:56:45,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:45,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187173848] [2019-12-07 11:56:45,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:45,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:45,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:45,404 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2019-12-07 11:56:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,466 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 11:56:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:45,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 11:56:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,467 INFO L225 Difference]: With dead ends: 72 [2019-12-07 11:56:45,467 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 11:56:45,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 11:56:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2019-12-07 11:56:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:56:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-12-07 11:56:45,472 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2019-12-07 11:56:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,472 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-12-07 11:56:45,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-12-07 11:56:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:56:45,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,472 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:45,473 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1167076850, now seen corresponding path program 1 times [2019-12-07 11:56:45,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792961798] [2019-12-07 11:56:45,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,507 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:56:45,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792961798] [2019-12-07 11:56:45,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718858715] [2019-12-07 11:56:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/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:56:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:56:45,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:45,569 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:56:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:45,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:56:45,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-12-07 11:56:45,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409732104] [2019-12-07 11:56:45,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:56:45,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:56:45,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:45,584 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2019-12-07 11:56:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,612 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-12-07 11:56:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:45,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 11:56:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,614 INFO L225 Difference]: With dead ends: 76 [2019-12-07 11:56:45,614 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 11:56:45,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 11:56:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2019-12-07 11:56:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:56:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 11:56:45,617 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 9 [2019-12-07 11:56:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,617 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 11:56:45,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:56:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 11:56:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:56:45,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:45,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:45,819 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1819713415, now seen corresponding path program 1 times [2019-12-07 11:56:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567653085] [2019-12-07 11:56:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:56:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567653085] [2019-12-07 11:56:45,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022619176] [2019-12-07 11:56:45,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:45,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:45,867 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 4 states. [2019-12-07 11:56:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:45,897 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-12-07 11:56:45,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:45,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 11:56:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:45,898 INFO L225 Difference]: With dead ends: 47 [2019-12-07 11:56:45,898 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 11:56:45,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 11:56:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 11:56:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:56:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 11:56:45,901 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 10 [2019-12-07 11:56:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:45,901 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 11:56:45,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 11:56:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:56:45,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:45,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:45,902 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1819713416, now seen corresponding path program 1 times [2019-12-07 11:56:45,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:45,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026923012] [2019-12-07 11:56:45,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:56:45,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026923012] [2019-12-07 11:56:45,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:45,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:45,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545690734] [2019-12-07 11:56:45,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:45,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:45,961 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-12-07 11:56:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:46,000 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 11:56:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:46,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 11:56:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:46,001 INFO L225 Difference]: With dead ends: 35 [2019-12-07 11:56:46,001 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:56:46,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:56:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 11:56:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 11:56:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-12-07 11:56:46,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 10 [2019-12-07 11:56:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:46,005 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-12-07 11:56:46,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-12-07 11:56:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:56:46,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:46,006 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:46,006 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 868747031, now seen corresponding path program 1 times [2019-12-07 11:56:46,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:46,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066499499] [2019-12-07 11:56:46,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:46,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066499499] [2019-12-07 11:56:46,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780873431] [2019-12-07 11:56:46,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:46,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:56:46,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:46,133 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_42|]} [2019-12-07 11:56:46,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:56:46,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-12-07 11:56:46,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:46,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:46,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 11:56:46,162 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:46,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:46,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:56:46,174 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:37 [2019-12-07 11:56:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:46,237 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:56:46,279 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 11:56:46,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 11:56:46,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:46,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:46,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:56:46,290 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:46,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:46,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:56:46,294 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-12-07 11:56:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:46,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [473123071] [2019-12-07 11:56:46,315 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 11:56:46,315 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:56:46,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:56:46,323 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:56:46,323 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:56:46,668 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:56:47,154 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 11:56:47,206 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:56:47,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:56:47,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2019-12-07 11:56:47,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007803005] [2019-12-07 11:56:47,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:56:47,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:56:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:56:47,208 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 14 states. [2019-12-07 11:56:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:47,589 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-12-07 11:56:47,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:56:47,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2019-12-07 11:56:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:47,590 INFO L225 Difference]: With dead ends: 71 [2019-12-07 11:56:47,590 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 11:56:47,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:56:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 11:56:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 38. [2019-12-07 11:56:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:56:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-12-07 11:56:47,593 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2019-12-07 11:56:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:47,593 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-12-07 11:56:47,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:56:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-12-07 11:56:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:56:47,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:47,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:47,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:47,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 5178916, now seen corresponding path program 1 times [2019-12-07 11:56:47,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:47,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696035548] [2019-12-07 11:56:47,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:56:47,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696035548] [2019-12-07 11:56:47,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:47,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:47,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317896566] [2019-12-07 11:56:47,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:47,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:47,814 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2019-12-07 11:56:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:47,822 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-12-07 11:56:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:47,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 11:56:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:47,823 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:56:47,823 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 11:56:47,823 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:56:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 11:56:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 11:56:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 11:56:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-12-07 11:56:47,825 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 13 [2019-12-07 11:56:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:47,825 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-12-07 11:56:47,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-12-07 11:56:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:56:47,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:47,826 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:47,826 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1642303770, now seen corresponding path program 2 times [2019-12-07 11:56:47,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:47,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189889985] [2019-12-07 11:56:47,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:47,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189889985] [2019-12-07 11:56:47,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241536323] [2019-12-07 11:56:47,863 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:47,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 11:56:47,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:56:47,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:56:47,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:56:47,975 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:56:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:56:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651661646] [2019-12-07 11:56:48,023 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-12-07 11:56:48,023 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:56:48,023 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:56:48,023 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:56:48,024 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:56:48,272 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:56:48,785 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-12-07 11:56:48,838 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:56:48,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:56:48,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2019-12-07 11:56:48,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310802485] [2019-12-07 11:56:48,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:56:48,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:56:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:56:48,840 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 13 states. [2019-12-07 11:56:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:49,362 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-12-07 11:56:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:56:49,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-12-07 11:56:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:49,362 INFO L225 Difference]: With dead ends: 72 [2019-12-07 11:56:49,363 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 11:56:49,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:56:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 11:56:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2019-12-07 11:56:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:56:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-12-07 11:56:49,365 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 13 [2019-12-07 11:56:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:49,365 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-12-07 11:56:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:56:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-12-07 11:56:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:56:49,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:49,366 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:49,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:49,567 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -628122930, now seen corresponding path program 1 times [2019-12-07 11:56:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:49,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746199099] [2019-12-07 11:56:49,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:56:49,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746199099] [2019-12-07 11:56:49,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:49,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:49,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418879782] [2019-12-07 11:56:49,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:49,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:56:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:49,616 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 6 states. [2019-12-07 11:56:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:49,656 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-12-07 11:56:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:49,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 11:56:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:49,657 INFO L225 Difference]: With dead ends: 59 [2019-12-07 11:56:49,657 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 11:56:49,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 11:56:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-12-07 11:56:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 11:56:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-12-07 11:56:49,659 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 14 [2019-12-07 11:56:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:49,659 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-12-07 11:56:49,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-12-07 11:56:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:56:49,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:49,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:49,660 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:56:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 681974470, now seen corresponding path program 1 times [2019-12-07 11:56:49,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:56:49,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279400716] [2019-12-07 11:56:49,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:49,686 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:56:49,686 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:56:49,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:56:49 BoogieIcfgContainer [2019-12-07 11:56:49,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:56:49,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:56:49,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:56:49,707 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:56:49,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:56:44" (3/4) ... [2019-12-07 11:56:49,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:56:49,738 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_95ae31c7-f48e-4f2d-a16d-00a9c75630dc/bin/utaipan/witness.graphml [2019-12-07 11:56:49,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:56:49,739 INFO L168 Benchmark]: Toolchain (without parser) took 5429.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -104.4 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:49,739 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:49,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:49,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.36 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:56:49,740 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 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:56:49,740 INFO L168 Benchmark]: RCFGBuilder took 257.45 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:49,740 INFO L168 Benchmark]: TraceAbstraction took 4794.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -5.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:49,741 INFO L168 Benchmark]: Witness Printer took 31.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:49,742 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.36 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 18.26 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 257.45 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4794.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -5.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 536]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int *a, *b; [L513] int n; [L525] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L526] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L529] a = malloc(n * sizeof(*a)) [L530] b = malloc(n * sizeof(*b)) [L531] EXPR b++ VAL [a={3:0}, b={-1:4}, n=1] [L531] *b++ = 0 [L517] int i; [L518] i = 0 VAL [a={3:0}, b={-1:4}, n=1] [L518] COND TRUE i < n VAL [a={3:0}, b={-1:4}, n=1] [L519] a[i] = -1 [L518] i++ VAL [a={3:0}, b={-1:4}, n=1] [L518] COND FALSE !(i < n) [L520] i = 0 VAL [a={3:0}, b={-1:4}, n=1] [L520] COND FALSE !(i < n - 1) VAL [a={3:0}, b={-1:4}, n=1] [L533] b[-1] VAL [a={3:0}, b={-1:4}, n=1] [L533] COND FALSE !(b[-1]) [L536] free(a) VAL [a={3:0}, b={-1:4}, n=1] [L536] free(a) VAL [a={3:0}, b={-1:4}, n=1] [L536] free(a) [L536] free(b) VAL [a={3:0}, b={-1:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 21 error locations. Result: UNSAFE, OverallTime: 4.7s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 328 SDtfs, 848 SDslu, 385 SDs, 0 SdLazy, 718 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, 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, 12 MinimizatonAttempts, 131 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 156 ConstructedInterpolants, 12 QuantifiedInterpolants, 14307 SizeOfPredicates, 17 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 33/51 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...