./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f25230c4e3ada1aa4514132cfb87afb0e539c23b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 00:50:32,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:50:32,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:50:32,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:50:32,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:50:32,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:50:32,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:50:32,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:50:32,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:50:32,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:50:32,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:50:32,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:50:32,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:50:32,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:50:32,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:50:32,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:50:32,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:50:32,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:50:32,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:50:32,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:50:32,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:50:32,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:50:32,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:50:32,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:50:32,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:50:32,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:50:32,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:50:32,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:50:32,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:50:32,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:50:32,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:50:32,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:50:32,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:50:32,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:50:32,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:50:32,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:50:32,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 00:50:32,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:50:32,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:50:32,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 00:50:32,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 00:50:32,048 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 00:50:32,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 00:50:32,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:50:32,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:50:32,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:50:32,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:50:32,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:50:32,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:50:32,051 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 00:50:32,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:50:32,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:50:32,051 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2018-12-02 00:50:32,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:50:32,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:50:32,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:50:32,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:50:32,077 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:50:32,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 00:50:32,112 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/data/684121aa0/f8bfe09e299e4253a2b1dfac5ae52dbb/FLAG5856f6e68 [2018-12-02 00:50:32,445 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:50:32,445 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/sv-benchmarks/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 00:50:32,452 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/data/684121aa0/f8bfe09e299e4253a2b1dfac5ae52dbb/FLAG5856f6e68 [2018-12-02 00:50:32,460 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/data/684121aa0/f8bfe09e299e4253a2b1dfac5ae52dbb [2018-12-02 00:50:32,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:50:32,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:50:32,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:50:32,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:50:32,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:50:32,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7300e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32, skipping insertion in model container [2018-12-02 00:50:32,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:50:32,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:50:32,628 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:50:32,635 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:50:32,698 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:50:32,724 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:50:32,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32 WrapperNode [2018-12-02 00:50:32,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:50:32,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:50:32,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:50:32,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:50:32,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:50:32,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:50:32,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:50:32,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:50:32,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... [2018-12-02 00:50:32,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:50:32,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:50:32,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:50:32,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:50:32,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 00:50:32,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 00:50:32,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 00:50:32,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:50:32,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:50:32,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:50:32,922 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 00:50:32,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:50:32 BoogieIcfgContainer [2018-12-02 00:50:32,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:50:32,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:50:32,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:50:32,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:50:32,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:50:32" (1/3) ... [2018-12-02 00:50:32,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b804c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:50:32, skipping insertion in model container [2018-12-02 00:50:32,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:50:32" (2/3) ... [2018-12-02 00:50:32,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b804c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:50:32, skipping insertion in model container [2018-12-02 00:50:32,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:50:32" (3/3) ... [2018-12-02 00:50:32,926 INFO L112 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-12-02 00:50:32,932 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:50:32,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 00:50:32,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 00:50:32,959 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:50:32,959 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 00:50:32,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:50:32,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:50:32,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:50:32,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:50:32,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:50:32,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:50:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-02 00:50:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 00:50:32,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:32,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:32,977 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:32,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1191221624, now seen corresponding path program 1 times [2018-12-02 00:50:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:50:33,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:50:33,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:33,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:50:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:50:33,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:50:33,081 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-02 00:50:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:33,120 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-02 00:50:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:50:33,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 00:50:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:33,127 INFO L225 Difference]: With dead ends: 36 [2018-12-02 00:50:33,127 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 00:50:33,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:50:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 00:50:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 00:50:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 00:50:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 00:50:33,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2018-12-02 00:50:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:33,148 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 00:50:33,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:50:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 00:50:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 00:50:33,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:33,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:33,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:33,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1992307641, now seen corresponding path program 1 times [2018-12-02 00:50:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:50:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 00:50:33,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:33,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:50:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:50:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:50:33,173 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-12-02 00:50:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:33,197 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-02 00:50:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:50:33,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 00:50:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:33,198 INFO L225 Difference]: With dead ends: 29 [2018-12-02 00:50:33,198 INFO L226 Difference]: Without dead ends: 29 [2018-12-02 00:50:33,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:50:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-02 00:50:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-02 00:50:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 00:50:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 00:50:33,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2018-12-02 00:50:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:33,203 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 00:50:33,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:50:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 00:50:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 00:50:33,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:33,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:33,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:33,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1992307640, now seen corresponding path program 1 times [2018-12-02 00:50:33,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:50:33,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:50:33,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:33,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:50:33,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:50:33,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:50:33,289 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-12-02 00:50:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:33,330 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-02 00:50:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:50:33,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-02 00:50:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:33,331 INFO L225 Difference]: With dead ends: 33 [2018-12-02 00:50:33,331 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 00:50:33,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:50:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 00:50:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-02 00:50:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 00:50:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 00:50:33,334 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 12 [2018-12-02 00:50:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:33,334 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 00:50:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:50:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-02 00:50:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 00:50:33,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:33,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:33,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:33,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash 275021761, now seen corresponding path program 1 times [2018-12-02 00:50:33,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:33,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:50:33,363 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-02 00:50:33,364 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [16], [24], [27], [31], [33], [35], [78], [79], [80] [2018-12-02 00:50:33,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:50:33,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:50:33,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:50:33,465 INFO L272 AbstractInterpreter]: Visited 14 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 4. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 00:50:33,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:50:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:33,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:50:33,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:50:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:50:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:50:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,559 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:50:33,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 8 [2018-12-02 00:50:33,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:33,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:50:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:50:33,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:50:33,560 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2018-12-02 00:50:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:33,594 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 00:50:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:50:33,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 00:50:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:33,594 INFO L225 Difference]: With dead ends: 54 [2018-12-02 00:50:33,595 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 00:50:33,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:50:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 00:50:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-02 00:50:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 00:50:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-12-02 00:50:33,597 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 16 [2018-12-02 00:50:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:33,598 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-12-02 00:50:33,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:50:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-12-02 00:50:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 00:50:33,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:33,598 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:33,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:33,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash -118005249, now seen corresponding path program 1 times [2018-12-02 00:50:33,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:33,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:50:33,674 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-02 00:50:33,675 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [16], [24], [27], [31], [33], [35], [78], [79], [80] [2018-12-02 00:50:33,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:50:33,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:50:33,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:50:33,736 INFO L272 AbstractInterpreter]: Visited 14 different actions 34 times. Merged at 5 different actions 20 times. Never widened. Performed 267 root evaluator evaluations with a maximum evaluation depth of 4. Performed 267 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 00:50:33,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:50:33,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:33,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:50:33,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:50:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:33,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:50:33,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 00:50:33,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 00:50:33,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 00:50:33,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-02 00:50:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:50:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:50:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-02 00:50:33,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:50:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:50:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:50:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:50:33,891 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2018-12-02 00:50:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:33,941 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-02 00:50:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:50:33,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 00:50:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:33,942 INFO L225 Difference]: With dead ends: 39 [2018-12-02 00:50:33,942 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 00:50:33,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:50:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 00:50:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-02 00:50:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 00:50:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-02 00:50:33,945 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2018-12-02 00:50:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:33,945 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-02 00:50:33,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:50:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-02 00:50:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 00:50:33,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:33,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:33,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:33,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash -64307563, now seen corresponding path program 1 times [2018-12-02 00:50:33,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:33,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:33,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:50:34,018 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-02 00:50:34,018 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [16], [22], [24], [27], [31], [35], [39], [47], [54], [78], [79], [80] [2018-12-02 00:50:34,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:50:34,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:50:34,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:50:34,035 INFO L272 AbstractInterpreter]: Visited 17 different actions 19 times. Merged at 1 different actions 1 times. Never widened. Performed 103 root evaluator evaluations with a maximum evaluation depth of 4. Performed 103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-02 00:50:34,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:50:34,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:50:34,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:50:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:50:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:50:34,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-02 00:50:34,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 00:50:34,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 00:50:34,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 00:50:34,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 00:50:34,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-12-02 00:50:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:50:34,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2018-12-02 00:50:34,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:50:34,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:50:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:50:34,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:50:34,145 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2018-12-02 00:50:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:34,340 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-12-02 00:50:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:50:34,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-12-02 00:50:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:34,341 INFO L225 Difference]: With dead ends: 100 [2018-12-02 00:50:34,341 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 00:50:34,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-12-02 00:50:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 00:50:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 45. [2018-12-02 00:50:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 00:50:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-12-02 00:50:34,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2018-12-02 00:50:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:34,346 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-02 00:50:34,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:50:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-12-02 00:50:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 00:50:34,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:34,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:34,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:34,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1735370209, now seen corresponding path program 1 times [2018-12-02 00:50:34,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:34,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:50:34,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:50:34,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:50:34,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:50:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:50:34,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:50:34,372 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 4 states. [2018-12-02 00:50:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:34,399 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-12-02 00:50:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:50:34,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 00:50:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:34,400 INFO L225 Difference]: With dead ends: 46 [2018-12-02 00:50:34,400 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 00:50:34,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:50:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 00:50:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-02 00:50:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 00:50:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 00:50:34,402 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2018-12-02 00:50:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:34,403 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 00:50:34,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:50:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 00:50:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 00:50:34,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:34,403 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:34,403 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:34,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1422800552, now seen corresponding path program 1 times [2018-12-02 00:50:34,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:34,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:50:34,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 00:50:34,496 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [16], [22], [24], [27], [31], [35], [39], [47], [52], [54], [57], [71], [78], [79], [80] [2018-12-02 00:50:34,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:50:34,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:50:34,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:50:34,513 INFO L272 AbstractInterpreter]: Visited 20 different actions 23 times. Merged at 2 different actions 2 times. Never widened. Performed 118 root evaluator evaluations with a maximum evaluation depth of 4. Performed 118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-12-02 00:50:34,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:50:34,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:50:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:50:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:50:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:50:34,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:50:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:50:34,591 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:50:34,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2018-12-02 00:50:34,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:34,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:50:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:50:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:50:34,592 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2018-12-02 00:50:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:34,609 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-02 00:50:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:50:34,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 00:50:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:34,609 INFO L225 Difference]: With dead ends: 56 [2018-12-02 00:50:34,609 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 00:50:34,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:50:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 00:50:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-12-02 00:50:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 00:50:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-02 00:50:34,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 21 [2018-12-02 00:50:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:34,612 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-02 00:50:34,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:50:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-12-02 00:50:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 00:50:34,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:34,612 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:34,613 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:34,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 142936874, now seen corresponding path program 1 times [2018-12-02 00:50:34,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:34,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:50:34,662 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 00:50:34,662 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [16], [22], [24], [27], [31], [35], [39], [47], [52], [54], [57], [71], [78], [79], [80] [2018-12-02 00:50:34,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:50:34,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:50:34,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:50:34,723 INFO L272 AbstractInterpreter]: Visited 20 different actions 48 times. Merged at 11 different actions 26 times. Widened at 1 different actions 1 times. Performed 278 root evaluator evaluations with a maximum evaluation depth of 4. Performed 278 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-02 00:50:34,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:34,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:50:34,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:50:34,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:50:34,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:34,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:50:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:34,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:50:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:50:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:50:34,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:50:34,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-02 00:50:34,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:50:34,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 00:50:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 00:50:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-02 00:50:34,862 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 13 states. [2018-12-02 00:50:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:35,070 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-12-02 00:50:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 00:50:35,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-12-02 00:50:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:35,071 INFO L225 Difference]: With dead ends: 74 [2018-12-02 00:50:35,071 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 00:50:35,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-12-02 00:50:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 00:50:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2018-12-02 00:50:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 00:50:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-12-02 00:50:35,074 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 21 [2018-12-02 00:50:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:35,074 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-02 00:50:35,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 00:50:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-12-02 00:50:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 00:50:35,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:50:35,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:50:35,075 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2018-12-02 00:50:35,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:50:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1157142958, now seen corresponding path program 1 times [2018-12-02 00:50:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:50:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:50:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:50:35,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:50:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:50:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 00:50:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:50:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:50:35,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:50:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:50:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:50:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:50:35,109 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 4 states. [2018-12-02 00:50:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:50:35,118 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-12-02 00:50:35,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:50:35,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 00:50:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:50:35,119 INFO L225 Difference]: With dead ends: 47 [2018-12-02 00:50:35,119 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 00:50:35,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:50:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 00:50:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 00:50:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 00:50:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 00:50:35,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-02 00:50:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:50:35,120 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:50:35,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:50:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:50:35,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 00:50:35,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:50:35 BoogieIcfgContainer [2018-12-02 00:50:35,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:50:35,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:50:35,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:50:35,124 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:50:35,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:50:32" (3/4) ... [2018-12-02 00:50:35,126 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 00:50:35,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 00:50:35,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 00:50:35,132 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 00:50:35,132 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 00:50:35,132 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 00:50:35,132 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 00:50:35,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a24399af-99bd-49f0-ab46-f574557da337/bin-2019/utaipan/witness.graphml [2018-12-02 00:50:35,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:50:35,157 INFO L168 Benchmark]: Toolchain (without parser) took 2694.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:50:35,158 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:50:35,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 00:50:35,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:50:35,158 INFO L168 Benchmark]: Boogie Preprocessor took 15.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:50:35,159 INFO L168 Benchmark]: RCFGBuilder took 164.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-12-02 00:50:35,159 INFO L168 Benchmark]: TraceAbstraction took 2200.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:50:35,159 INFO L168 Benchmark]: Witness Printer took 32.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:50:35,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 164.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2200.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. * Witness Printer took 32.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 9 error locations. SAFE Result, 2.1s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 224 SDtfs, 652 SDslu, 438 SDs, 0 SdLazy, 505 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 106 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 327 ConstructedInterpolants, 7 QuantifiedInterpolants, 30019 SizeOfPredicates, 17 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 26/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...