./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/simple_built_from_end.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_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 41b5142f2d6582efd6d9a128e4dfef83faaab097 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 41b5142f2d6582efd6d9a128e4dfef83faaab097 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:00:08,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:00:08,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:00:08,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:00:08,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:00:08,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:00:08,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:00:08,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:00:08,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:00:08,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:00:08,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:00:08,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:00:08,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:00:08,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:00:08,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:00:08,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:00:08,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:00:08,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:00:08,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:00:08,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:00:08,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:00:08,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:00:08,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:00:08,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:00:08,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:00:08,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:00:08,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:00:08,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:00:08,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:00:08,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:00:08,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:00:08,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:00:08,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:00:08,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:00:08,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:00:08,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:00:08,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:00:08,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:00:08,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:00:08,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:00:08,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:00:08,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 13:00:08,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:00:08,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:00:08,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:00:08,658 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:00:08,658 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:00:08,658 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:00:08,659 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:00:08,659 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:00:08,660 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:00:08,660 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:00:08,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:00:08,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:00:08,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:00:08,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:00:08,661 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:00:08,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:00:08,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:00:08,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:00:08,663 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:00:08,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:00:08,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:00:08,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:00:08,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:00:08,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:00:08,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:00:08,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:00:08,664 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:00:08,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:00:08,664 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:00:08,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:00:08,665 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_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 -> 41b5142f2d6582efd6d9a128e4dfef83faaab097 [2019-12-07 13:00:08,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:00:08,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:00:08,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:00:08,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:00:08,782 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:00:08,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-12-07 13:00:08,819 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/bd804d9dc/3d7f24482b6a49e5b4457bca9cb6a02a/FLAG02d685ba5 [2019-12-07 13:00:09,259 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:00:09,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-12-07 13:00:09,267 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/bd804d9dc/3d7f24482b6a49e5b4457bca9cb6a02a/FLAG02d685ba5 [2019-12-07 13:00:09,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/bd804d9dc/3d7f24482b6a49e5b4457bca9cb6a02a [2019-12-07 13:00:09,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:00:09,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:00:09,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:09,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:00:09,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:00:09,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513e5c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09, skipping insertion in model container [2019-12-07 13:00:09,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:00:09,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:00:09,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:09,531 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:00:09,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:09,587 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:00:09,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09 WrapperNode [2019-12-07 13:00:09,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:09,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:09,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:00:09,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:00:09,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:09,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:00:09,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:00:09,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:00:09,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... [2019-12-07 13:00:09,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:00:09,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:00:09,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:00:09,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:00:09,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 13:00:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:00:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:00:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:00:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:00:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:00:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:00:09,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:00:09,857 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:00:09,857 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:00:09,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:09 BoogieIcfgContainer [2019-12-07 13:00:09,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:00:09,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:00:09,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:00:09,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:00:09,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:00:09" (1/3) ... [2019-12-07 13:00:09,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e9090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:09, skipping insertion in model container [2019-12-07 13:00:09,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:09" (2/3) ... [2019-12-07 13:00:09,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e9090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:09, skipping insertion in model container [2019-12-07 13:00:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:09" (3/3) ... [2019-12-07 13:00:09,864 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2019-12-07 13:00:09,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:00:09,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 13:00:09,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 13:00:09,895 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:00:09,895 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:00:09,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:00:09,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:00:09,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:00:09,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:00:09,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:00:09,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:00:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-12-07 13:00:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:00:09,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:09,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:00:09,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2769752, now seen corresponding path program 1 times [2019-12-07 13:00:09,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:09,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359464808] [2019-12-07 13:00:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:09,990 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 13:00:09,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359464808] [2019-12-07 13:00:09,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:09,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:09,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140205901] [2019-12-07 13:00:09,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 13:00:09,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 13:00:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 13:00:10,005 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-12-07 13:00:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,013 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-12-07 13:00:10,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:00:10,014 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-07 13:00:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,020 INFO L225 Difference]: With dead ends: 24 [2019-12-07 13:00:10,020 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 13:00:10,021 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 13:00:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 13:00:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 13:00:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:00:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 13:00:10,048 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2019-12-07 13:00:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,048 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 13:00:10,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 13:00:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 13:00:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:10,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:10,049 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash 85184151, now seen corresponding path program 1 times [2019-12-07 13:00:10,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198473215] [2019-12-07 13:00:10,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,073 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 13:00:10,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198473215] [2019-12-07 13:00:10,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:00:10,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073820438] [2019-12-07 13:00:10,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:10,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:10,076 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2019-12-07 13:00:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,100 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 13:00:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:10,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,101 INFO L225 Difference]: With dead ends: 35 [2019-12-07 13:00:10,101 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 13:00:10,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 13:00:10,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-12-07 13:00:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:00:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-12-07 13:00:10,105 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 5 [2019-12-07 13:00:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,105 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-12-07 13:00:10,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-12-07 13:00:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:10,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:10,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash 85183265, now seen corresponding path program 1 times [2019-12-07 13:00:10,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404496118] [2019-12-07 13:00:10,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,125 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 13:00:10,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404496118] [2019-12-07 13:00:10,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:10,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792797355] [2019-12-07 13:00:10,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:10,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:10,126 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 3 states. [2019-12-07 13:00:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,139 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-12-07 13:00:10,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:10,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,140 INFO L225 Difference]: With dead ends: 32 [2019-12-07 13:00:10,140 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 13:00:10,141 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 13:00:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 13:00:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-12-07 13:00:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:00:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 13:00:10,143 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 5 [2019-12-07 13:00:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,143 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 13:00:10,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 13:00:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:10,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:10,144 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 85184580, now seen corresponding path program 1 times [2019-12-07 13:00:10,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562369095] [2019-12-07 13:00:10,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,168 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 13:00:10,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562369095] [2019-12-07 13:00:10,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:10,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134290639] [2019-12-07 13:00:10,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:10,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:10,169 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2019-12-07 13:00:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,187 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-12-07 13:00:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:10,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,188 INFO L225 Difference]: With dead ends: 22 [2019-12-07 13:00:10,188 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 13:00:10,189 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 13:00:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 13:00:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 13:00:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:00:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 13:00:10,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 5 [2019-12-07 13:00:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,191 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 13:00:10,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 13:00:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:10,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:10,191 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash 85184581, now seen corresponding path program 1 times [2019-12-07 13:00:10,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112870259] [2019-12-07 13:00:10,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,225 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 13:00:10,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112870259] [2019-12-07 13:00:10,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:00:10,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932301577] [2019-12-07 13:00:10,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:10,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:10,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:10,226 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2019-12-07 13:00:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,242 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-12-07 13:00:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:10,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,243 INFO L225 Difference]: With dead ends: 20 [2019-12-07 13:00:10,243 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 13:00:10,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 13:00:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 13:00:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 13:00:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 13:00:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-12-07 13:00:10,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2019-12-07 13:00:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,246 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-12-07 13:00:10,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-12-07 13:00:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:10,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,247 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:10,247 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1800659432, now seen corresponding path program 1 times [2019-12-07 13:00:10,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844665781] [2019-12-07 13:00:10,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,291 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 13:00:10,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844665781] [2019-12-07 13:00:10,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:00:10,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303281337] [2019-12-07 13:00:10,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:00:10,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:00:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:10,292 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-12-07 13:00:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,333 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-12-07 13:00:10,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:00:10,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 13:00:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,334 INFO L225 Difference]: With dead ends: 33 [2019-12-07 13:00:10,334 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 13:00:10,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:00:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 13:00:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-12-07 13:00:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:00:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 13:00:10,336 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 10 [2019-12-07 13:00:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,336 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 13:00:10,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:00:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 13:00:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:10,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,337 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:10,337 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1800660318, now seen corresponding path program 1 times [2019-12-07 13:00:10,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088721638] [2019-12-07 13:00:10,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,361 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 13:00:10,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088721638] [2019-12-07 13:00:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:00:10,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83270434] [2019-12-07 13:00:10,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:10,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:10,363 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2019-12-07 13:00:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,395 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-12-07 13:00:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:00:10,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:00:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,396 INFO L225 Difference]: With dead ends: 25 [2019-12-07 13:00:10,396 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 13:00:10,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 13:00:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-12-07 13:00:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:00:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-12-07 13:00:10,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2019-12-07 13:00:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,399 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-12-07 13:00:10,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-12-07 13:00:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:10,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,400 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:10,400 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1800660317, now seen corresponding path program 1 times [2019-12-07 13:00:10,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238565477] [2019-12-07 13:00:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,453 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 13:00:10,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238565477] [2019-12-07 13:00:10,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:00:10,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464932233] [2019-12-07 13:00:10,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:10,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:10,454 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2019-12-07 13:00:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,486 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-12-07 13:00:10,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:00:10,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:00:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,487 INFO L225 Difference]: With dead ends: 28 [2019-12-07 13:00:10,487 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 13:00:10,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:00:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 13:00:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-12-07 13:00:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 13:00:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 13:00:10,489 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2019-12-07 13:00:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,489 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 13:00:10,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-12-07 13:00:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:00:10,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,490 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:10,490 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 437255107, now seen corresponding path program 1 times [2019-12-07 13:00:10,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031483539] [2019-12-07 13:00:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:10,527 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 13:00:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031483539] [2019-12-07 13:00:10,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:10,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:00:10,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364755147] [2019-12-07 13:00:10,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:00:10,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:00:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:00:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:10,529 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-12-07 13:00:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:10,571 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-12-07 13:00:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:00:10,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 13:00:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:10,571 INFO L225 Difference]: With dead ends: 26 [2019-12-07 13:00:10,571 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 13:00:10,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:00:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 13:00:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-12-07 13:00:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 13:00:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 13:00:10,573 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2019-12-07 13:00:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:10,574 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 13:00:10,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:00:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 13:00:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:00:10,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:10,574 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:10,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -704469817, now seen corresponding path program 1 times [2019-12-07 13:00:10,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:00:10,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113177251] [2019-12-07 13:00:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:00:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:00:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:00:10,606 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:00:10,606 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:00:10,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:00:10 BoogieIcfgContainer [2019-12-07 13:00:10,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:00:10,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:00:10,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:00:10,623 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:00:10,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:09" (3/4) ... [2019-12-07 13:00:10,625 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:00:10,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:00:10,627 INFO L168 Benchmark]: Toolchain (without parser) took 1346.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 940.7 MB in the beginning and 919.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:10,627 INFO L168 Benchmark]: CDTParser took 0.13 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 13:00:10,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:10,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.90 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 13:00:10,628 INFO L168 Benchmark]: Boogie Preprocessor took 17.56 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 13:00:10,628 INFO L168 Benchmark]: RCFGBuilder took 223.09 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: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:10,629 INFO L168 Benchmark]: TraceAbstraction took 763.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.0 MB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:10,629 INFO L168 Benchmark]: Witness Printer took 3.01 ms. Allocated memory is still 1.1 GB. Free memory is still 919.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:00:10,631 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.13 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 306.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -127.2 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.56 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 223.09 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: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 763.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.0 MB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.01 ms. Allocated memory is still 1.1 GB. Free memory is still 919.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List t; [L522] List p = 0; [L523] COND TRUE __VERIFIER_nondet_int() [L524] t = (List) malloc(sizeof(struct node)) [L525] COND FALSE !(t == 0) [L526] t->h = 1 [L527] t->n = p [L528] p = t [L523] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND TRUE p!=0 [L531] EXPR p->h [L531] COND FALSE !(p->h != 1) [L534] EXPR p->n [L534] p = p->n [L530] COND FALSE !(p!=0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 10 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 138 SDtfs, 182 SDslu, 64 SDs, 0 SdLazy, 150 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, 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, 9 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 13:00:11,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:00:11,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:00:11,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:00:11,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:00:11,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:00:11,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:00:11,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:00:12,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:00:12,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:00:12,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:00:12,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:00:12,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:00:12,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:00:12,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:00:12,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:00:12,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:00:12,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:00:12,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:00:12,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:00:12,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:00:12,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:00:12,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:00:12,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:00:12,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:00:12,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:00:12,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:00:12,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:00:12,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:00:12,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:00:12,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:00:12,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:00:12,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:00:12,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:00:12,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:00:12,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:00:12,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:00:12,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:00:12,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:00:12,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:00:12,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:00:12,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 13:00:12,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:00:12,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:00:12,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:00:12,032 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:00:12,032 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:00:12,032 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:00:12,033 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:00:12,033 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:00:12,033 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:00:12,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:00:12,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:00:12,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:00:12,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:00:12,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:00:12,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:00:12,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:00:12,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:00:12,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:00:12,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:00:12,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:00:12,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:00:12,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:00:12,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:00:12,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:00:12,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:00:12,037 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 -> 41b5142f2d6582efd6d9a128e4dfef83faaab097 [2019-12-07 13:00:12,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:00:12,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:00:12,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:00:12,228 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:00:12,228 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:00:12,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-12-07 13:00:12,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/7ff60a30a/852d6212b0004f86ac78bbd13a283667/FLAG76b64f906 [2019-12-07 13:00:12,724 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:00:12,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-12-07 13:00:12,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/7ff60a30a/852d6212b0004f86ac78bbd13a283667/FLAG76b64f906 [2019-12-07 13:00:12,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/data/7ff60a30a/852d6212b0004f86ac78bbd13a283667 [2019-12-07 13:00:12,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:00:12,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:00:12,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:12,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:00:12,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:00:12,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:12" (1/1) ... [2019-12-07 13:00:12,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b62f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:12, skipping insertion in model container [2019-12-07 13:00:12,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:00:12" (1/1) ... [2019-12-07 13:00:12,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:00:12,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:00:13,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:13,009 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:00:13,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:00:13,071 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:00:13,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13 WrapperNode [2019-12-07 13:00:13,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:00:13,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:13,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:00:13,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:00:13,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:00:13,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:00:13,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:00:13,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:00:13,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... [2019-12-07 13:00:13,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:00:13,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:00:13,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:00:13,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:00:13,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/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 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:00:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:00:13,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:00:13,350 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:00:13,350 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:00:13,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:13 BoogieIcfgContainer [2019-12-07 13:00:13,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:00:13,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:00:13,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:00:13,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:00:13,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:00:12" (1/3) ... [2019-12-07 13:00:13,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ad5984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:13, skipping insertion in model container [2019-12-07 13:00:13,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:00:13" (2/3) ... [2019-12-07 13:00:13,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ad5984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:00:13, skipping insertion in model container [2019-12-07 13:00:13,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:13" (3/3) ... [2019-12-07 13:00:13,355 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2019-12-07 13:00:13,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:00:13,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 13:00:13,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 13:00:13,384 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:00:13,385 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:00:13,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:00:13,385 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:00:13,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:00:13,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:00:13,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:00:13,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:00:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-12-07 13:00:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:13,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:13,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:13,399 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 28698492, now seen corresponding path program 1 times [2019-12-07 13:00:13,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:13,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991035464] [2019-12-07 13:00:13,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:13,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:00:13,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:13,476 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 13:00:13,477 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:13,479 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 13:00:13,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991035464] [2019-12-07 13:00:13,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:13,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:00:13,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205085703] [2019-12-07 13:00:13,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:13,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:13,498 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-12-07 13:00:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:13,557 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-12-07 13:00:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:13,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:13,565 INFO L225 Difference]: With dead ends: 40 [2019-12-07 13:00:13,565 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 13:00:13,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 13:00:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 13:00:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-12-07 13:00:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 13:00:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-12-07 13:00:13,592 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2019-12-07 13:00:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:13,592 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-12-07 13:00:13,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-12-07 13:00:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:13,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:13,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:13,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:00:13,794 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 28698536, now seen corresponding path program 1 times [2019-12-07 13:00:13,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:13,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805592459] [2019-12-07 13:00:13,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:13,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:00:13,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:13,856 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 13:00:13,856 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:13,858 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 13:00:13,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805592459] [2019-12-07 13:00:13,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:13,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:00:13,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912763471] [2019-12-07 13:00:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:13,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:13,860 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2019-12-07 13:00:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:13,900 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-12-07 13:00:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:13,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:13,902 INFO L225 Difference]: With dead ends: 34 [2019-12-07 13:00:13,902 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 13:00:13,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 13:00:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 13:00:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-12-07 13:00:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 13:00:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 13:00:13,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2019-12-07 13:00:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:13,906 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 13:00:13,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-12-07 13:00:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:13,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:13,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:14,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2019-12-07 13:00:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:14,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069124190] [2019-12-07 13:00:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:14,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:00:14,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:14,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:00:14,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:14,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:14,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:14,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:00:14,201 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 13:00:14,202 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:14,203 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 13:00:14,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069124190] [2019-12-07 13:00:14,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:14,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:00:14,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802860120] [2019-12-07 13:00:14,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:00:14,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:00:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:00:14,205 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2019-12-07 13:00:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:14,241 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-12-07 13:00:14,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:14,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:00:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:14,242 INFO L225 Difference]: With dead ends: 23 [2019-12-07 13:00:14,242 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 13:00:14,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 13:00:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 13:00:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 13:00:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 13:00:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 13:00:14,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2019-12-07 13:00:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:14,245 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 13:00:14,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:00:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 13:00:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:00:14,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:14,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:00:14,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2019-12-07 13:00:14,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:14,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462420823] [2019-12-07 13:00:14,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:14,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:00:14,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:14,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:00:14,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:14,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:14,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:14,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:00:14,516 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 13:00:14,516 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:14,549 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 13:00:14,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462420823] [2019-12-07 13:00:14,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:14,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:00:14,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30817771] [2019-12-07 13:00:14,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:14,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:14,551 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 4 states. [2019-12-07 13:00:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:14,589 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 13:00:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:00:14,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 13:00:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:14,590 INFO L225 Difference]: With dead ends: 21 [2019-12-07 13:00:14,590 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 13:00:14,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 13:00:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 13:00:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 13:00:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:00:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 13:00:14,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2019-12-07 13:00:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:14,593 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 13:00:14,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 13:00:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:14,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:14,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:14,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash -653129230, now seen corresponding path program 1 times [2019-12-07 13:00:14,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:14,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733496623] [2019-12-07 13:00:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:14,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:00:14,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:14,867 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:14,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733496623] [2019-12-07 13:00:14,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:14,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 13:00:14,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620010906] [2019-12-07 13:00:14,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:14,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:14,870 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2019-12-07 13:00:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:14,956 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 13:00:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:00:14,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:00:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:14,957 INFO L225 Difference]: With dead ends: 36 [2019-12-07 13:00:14,958 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 13:00:14,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 13:00:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 13:00:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2019-12-07 13:00:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:00:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 13:00:14,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2019-12-07 13:00:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:14,961 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 13:00:14,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 13:00:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:14,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:14,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:15,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:00:15,162 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -653129186, now seen corresponding path program 1 times [2019-12-07 13:00:15,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:15,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570466381] [2019-12-07 13:00:15,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:15,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:00:15,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:15,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:00:15,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:15,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:15,232 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:15,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:00:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:15,242 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:15,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570466381] [2019-12-07 13:00:15,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:15,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:00:15,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924817042] [2019-12-07 13:00:15,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:00:15,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:00:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:00:15,250 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2019-12-07 13:00:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:15,344 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 13:00:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:00:15,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:00:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:15,345 INFO L225 Difference]: With dead ends: 27 [2019-12-07 13:00:15,345 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 13:00:15,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 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 13:00:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 13:00:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-12-07 13:00:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:00:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-12-07 13:00:15,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2019-12-07 13:00:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:15,348 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-12-07 13:00:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:00:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-12-07 13:00:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:00:15,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:15,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:15,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:00:15,550 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash -653129185, now seen corresponding path program 1 times [2019-12-07 13:00:15,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:15,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389855729] [2019-12-07 13:00:15,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:15,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:00:15,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:15,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:00:15,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:15,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:15,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:15,637 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:00:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:15,675 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:15,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389855729] [2019-12-07 13:00:15,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:15,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 13:00:15,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425763286] [2019-12-07 13:00:15,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:00:15,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:00:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:00:15,750 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-12-07 13:00:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:15,872 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-12-07 13:00:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:00:15,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 13:00:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:15,873 INFO L225 Difference]: With dead ends: 31 [2019-12-07 13:00:15,873 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 13:00:15,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:00:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 13:00:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-12-07 13:00:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:00:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 13:00:15,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2019-12-07 13:00:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:15,877 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 13:00:15,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:00:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-12-07 13:00:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:00:15,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:15,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:16,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 13:00:16,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash -591922145, now seen corresponding path program 1 times [2019-12-07 13:00:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:16,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130590304] [2019-12-07 13:00:16,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:00:16,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:00:16,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:00:16,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:00:16,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:16,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 13:00:16,190 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 13:00:16,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:00:16,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:16,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:7 [2019-12-07 13:00:16,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 13:00:16,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:16,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:00:16,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2019-12-07 13:00:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:16,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:00:16,228 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:00:16,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:00:16,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:00:16,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:14 [2019-12-07 13:00:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:00:16,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130590304] [2019-12-07 13:00:16,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:00:16,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 13:00:16,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947397204] [2019-12-07 13:00:16,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:00:16,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:00:16,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:00:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:00:16,239 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-12-07 13:00:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:00:16,354 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-12-07 13:00:16,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:00:16,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 13:00:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:00:16,355 INFO L225 Difference]: With dead ends: 28 [2019-12-07 13:00:16,355 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 13:00:16,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:00:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 13:00:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-12-07 13:00:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:00:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 13:00:16,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2019-12-07 13:00:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:00:16,359 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 13:00:16,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:00:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 13:00:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:00:16,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:00:16,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:00:16,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 13:00:16,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2019-12-07 13:00:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:00:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1187913323, now seen corresponding path program 1 times [2019-12-07 13:00:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:00:16,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023718332] [2019-12-07 13:00:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ea21c2-9e9b-42a5-8dda-5fb4f6001562/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 13:00:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:00:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:00:16,682 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 13:00:16,683 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:00:16,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 13:00:16,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:00:16 BoogieIcfgContainer [2019-12-07 13:00:16,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:00:16,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:00:16,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:00:16,924 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:00:16,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:00:13" (3/4) ... [2019-12-07 13:00:16,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:00:16,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:00:16,929 INFO L168 Benchmark]: Toolchain (without parser) took 4183.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.4 MB in the beginning and 844.9 MB in the end (delta: 103.4 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:16,929 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:00:16,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:16,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:16,931 INFO L168 Benchmark]: Boogie Preprocessor took 20.13 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 13:00:16,931 INFO L168 Benchmark]: RCFGBuilder took 225.89 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:16,931 INFO L168 Benchmark]: TraceAbstraction took 3572.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 844.9 MB in the end (delta: 228.3 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:00:16,932 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.1 GB. Free memory is still 844.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:00:16,933 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.28 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 225.89 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3572.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 844.9 MB in the end (delta: 228.3 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.1 GB. Free memory is still 844.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 520. Possible FailurePath: [L521] List t; [L522] List p = 0; [L523] COND TRUE __VERIFIER_nondet_int() [L524] t = (List) malloc(sizeof(struct node)) [L525] COND FALSE !(t == 0) [L526] t->h = 1 [L527] t->n = p [L528] p = t [L523] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND TRUE p!=0 [L531] EXPR p->h [L531] COND FALSE !(p->h != 1) [L534] EXPR p->n [L534] p = p->n [L530] COND FALSE !(p!=0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Result: UNSAFE, OverallTime: 3.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 119 SDtfs, 206 SDslu, 64 SDs, 0 SdLazy, 175 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 4574 SizeOfPredicates, 22 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 8/8 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...