./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/substring-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_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 0116566dfd4e4e63b59200ee97d098541aa6c54d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:20:31,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:20:31,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:20:31,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:20:31,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:20:31,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:20:31,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:20:31,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:20:31,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:20:31,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:20:31,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:20:31,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:20:31,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:20:31,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:20:31,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:20:31,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:20:31,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:20:31,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:20:31,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:20:31,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:20:31,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:20:31,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:20:31,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:20:31,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:20:31,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:20:31,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:20:31,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:20:31,775 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:20:31,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:20:31,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:20:31,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:20:31,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:20:31,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:20:31,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:20:31,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:20:31,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:20:31,778 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 08:20:31,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:20:31,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:20:31,785 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:20:31,786 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:20:31,786 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:20:31,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:20:31,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 08:20:31,787 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:20:31,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:20:31,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:20:31,788 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:20:31,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:20:31,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:20:31,789 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_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-12-02 08:20:31,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:20:31,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:20:31,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:20:31,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:20:31,820 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:20:31,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 08:20:31,864 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/data/964dfba40/cd00964784eb4fd9b1406b9c6e4d6f97/FLAG5def31d81 [2018-12-02 08:20:32,200 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:20:32,201 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 08:20:32,207 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/data/964dfba40/cd00964784eb4fd9b1406b9c6e4d6f97/FLAG5def31d81 [2018-12-02 08:20:32,628 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/data/964dfba40/cd00964784eb4fd9b1406b9c6e4d6f97 [2018-12-02 08:20:32,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:20:32,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:20:32,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:20:32,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:20:32,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:20:32,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32, skipping insertion in model container [2018-12-02 08:20:32,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:20:32,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:20:32,796 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:20:32,803 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:20:32,863 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:20:32,886 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:20:32,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32 WrapperNode [2018-12-02 08:20:32,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:20:32,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:20:32,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:20:32,887 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:20:32,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:20:32,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:20:32,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:20:32,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:20:32,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... [2018-12-02 08:20:32,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:20:32,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:20:32,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:20:32,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:20:32,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:20:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:20:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2018-12-02 08:20:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2018-12-02 08:20:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:20:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:20:33,126 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:20:33,126 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 08:20:33,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:33 BoogieIcfgContainer [2018-12-02 08:20:33,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:20:33,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:20:33,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:20:33,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:20:33,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:20:32" (1/3) ... [2018-12-02 08:20:33,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881b892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:33, skipping insertion in model container [2018-12-02 08:20:33,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:32" (2/3) ... [2018-12-02 08:20:33,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881b892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:33, skipping insertion in model container [2018-12-02 08:20:33,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:33" (3/3) ... [2018-12-02 08:20:33,131 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-02 08:20:33,137 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:20:33,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 08:20:33,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 08:20:33,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:20:33,167 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 08:20:33,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:20:33,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:20:33,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:20:33,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:20:33,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:20:33,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:20:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-02 08:20:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:20:33,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,184 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash 494354843, now seen corresponding path program 1 times [2018-12-02 08:20:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,286 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 08:20:33,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:20:33,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:20:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:20:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:20:33,299 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-02 08:20:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,337 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 08:20:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:20:33,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:20:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,344 INFO L225 Difference]: With dead ends: 46 [2018-12-02 08:20:33,344 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 08:20:33,345 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 08:20:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 08:20:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 08:20:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 08:20:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 08:20:33,366 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-02 08:20:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,367 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 08:20:33,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:20:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 08:20:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:20:33,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,367 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 494354844, now seen corresponding path program 1 times [2018-12-02 08:20:33,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,416 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 08:20:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:20:33,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:20:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:20:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:20:33,418 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-02 08:20:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,432 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-02 08:20:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:20:33,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 08:20:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,433 INFO L225 Difference]: With dead ends: 42 [2018-12-02 08:20:33,434 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 08:20:33,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:20:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 08:20:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 08:20:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 08:20:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 08:20:33,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-02 08:20:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,437 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 08:20:33,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:20:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 08:20:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 08:20:33,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,438 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1854869059, now seen corresponding path program 1 times [2018-12-02 08:20:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,456 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 08:20:33,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:20:33,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:20:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:20:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:20:33,457 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-02 08:20:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,474 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-02 08:20:33,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:20:33,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 08:20:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,475 INFO L225 Difference]: With dead ends: 41 [2018-12-02 08:20:33,475 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 08:20:33,475 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 08:20:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 08:20:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 08:20:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 08:20:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 08:20:33,478 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-02 08:20:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,478 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 08:20:33,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:20:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 08:20:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 08:20:33,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1854869058, now seen corresponding path program 1 times [2018-12-02 08:20:33,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,508 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 08:20:33,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:20:33,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:20:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:20:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:20:33,509 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-02 08:20:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,519 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-02 08:20:33,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:20:33,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 08:20:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,521 INFO L225 Difference]: With dead ends: 40 [2018-12-02 08:20:33,521 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 08:20:33,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:20:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 08:20:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 08:20:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 08:20:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 08:20:33,524 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-02 08:20:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,524 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 08:20:33,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:20:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 08:20:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 08:20:33,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,525 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash 645148417, now seen corresponding path program 1 times [2018-12-02 08:20:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,555 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 08:20:33,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:20:33,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:20:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:20:33,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:20:33,556 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-02 08:20:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,596 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-02 08:20:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:20:33,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 08:20:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,597 INFO L225 Difference]: With dead ends: 39 [2018-12-02 08:20:33,597 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 08:20:33,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:20:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 08:20:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 08:20:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 08:20:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 08:20:33,599 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-12-02 08:20:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,600 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 08:20:33,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:20:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 08:20:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 08:20:33,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash 645148418, now seen corresponding path program 1 times [2018-12-02 08:20:33,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,650 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 08:20:33,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:20:33,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:20:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:20:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:20:33,650 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-02 08:20:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,719 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-02 08:20:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:20:33,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 08:20:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,721 INFO L225 Difference]: With dead ends: 61 [2018-12-02 08:20:33,721 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 08:20:33,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:20:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 08:20:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-12-02 08:20:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 08:20:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 08:20:33,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-02 08:20:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,724 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 08:20:33,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:20:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 08:20:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 08:20:33,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,725 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1512338471, now seen corresponding path program 1 times [2018-12-02 08:20:33,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,780 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 08:20:33,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:20:33,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:20:33,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:20:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:20:33,781 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2018-12-02 08:20:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,877 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-02 08:20:33,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:20:33,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-02 08:20:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,877 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:20:33,878 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 08:20:33,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:20:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 08:20:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2018-12-02 08:20:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 08:20:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-12-02 08:20:33,880 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 16 [2018-12-02 08:20:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,881 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-12-02 08:20:33,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:20:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-12-02 08:20:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 08:20:33,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:33,881 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1512338470, now seen corresponding path program 1 times [2018-12-02 08:20:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:33,908 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 08:20:33,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:33,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:20:33,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:20:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:20:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:20:33,909 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 6 states. [2018-12-02 08:20:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:33,970 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-12-02 08:20:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:20:33,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 08:20:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:33,971 INFO L225 Difference]: With dead ends: 49 [2018-12-02 08:20:33,971 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 08:20:33,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:20:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 08:20:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-02 08:20:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 08:20:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-02 08:20:33,974 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2018-12-02 08:20:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:33,974 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-02 08:20:33,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:20:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-02 08:20:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:20:33,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:33,975 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] [2018-12-02 08:20:33,975 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:33,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash 192803602, now seen corresponding path program 1 times [2018-12-02 08:20:33,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:33,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,014 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 08:20:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:20:34,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:34,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:20:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:20:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:20:34,015 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-12-02 08:20:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:34,058 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-02 08:20:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:20:34,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 08:20:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:34,059 INFO L225 Difference]: With dead ends: 44 [2018-12-02 08:20:34,059 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 08:20:34,059 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 08:20:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 08:20:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 08:20:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 08:20:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-02 08:20:34,062 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2018-12-02 08:20:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:34,062 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-02 08:20:34,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:20:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-02 08:20:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:20:34,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:34,063 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] [2018-12-02 08:20:34,064 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:34,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 216721836, now seen corresponding path program 1 times [2018-12-02 08:20:34,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,095 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 08:20:34,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:34,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:20:34,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:34,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:20:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:20:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:20:34,096 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-12-02 08:20:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:34,133 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-02 08:20:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:20:34,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 08:20:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:34,134 INFO L225 Difference]: With dead ends: 39 [2018-12-02 08:20:34,134 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 08:20:34,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:20:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 08:20:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-02 08:20:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 08:20:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-02 08:20:34,136 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-12-02 08:20:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:34,136 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-02 08:20:34,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:20:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-02 08:20:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:20:34,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:34,136 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] [2018-12-02 08:20:34,137 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:34,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 216721837, now seen corresponding path program 1 times [2018-12-02 08:20:34,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:34,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,178 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 08:20:34,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:34,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:20:34,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:34,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:20:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:20:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:20:34,179 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-02 08:20:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:34,236 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-12-02 08:20:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:20:34,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-02 08:20:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:34,237 INFO L225 Difference]: With dead ends: 64 [2018-12-02 08:20:34,237 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 08:20:34,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:20:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 08:20:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-12-02 08:20:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:20:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-02 08:20:34,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 20 [2018-12-02 08:20:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:34,241 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-02 08:20:34,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:20:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-02 08:20:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:20:34,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:34,241 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] [2018-12-02 08:20:34,242 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:34,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 216730910, now seen corresponding path program 1 times [2018-12-02 08:20:34,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:20:34,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:34,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:20:34,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:34,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:20:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:20:34,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:20:34,258 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-12-02 08:20:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:34,265 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-02 08:20:34,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:20:34,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 08:20:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:34,266 INFO L225 Difference]: With dead ends: 46 [2018-12-02 08:20:34,266 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 08:20:34,267 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 08:20:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 08:20:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 08:20:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 08:20:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 08:20:34,269 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2018-12-02 08:20:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:34,269 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 08:20:34,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:20:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 08:20:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:20:34,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:34,269 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 08:20:34,269 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:34,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2119939246, now seen corresponding path program 1 times [2018-12-02 08:20:34,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:20:34,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:20:34,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:20:34,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:34,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:20:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:20:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:20:34,307 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-02 08:20:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:20:34,353 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-02 08:20:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:20:34,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-02 08:20:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:20:34,354 INFO L225 Difference]: With dead ends: 50 [2018-12-02 08:20:34,354 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 08:20:34,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:20:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 08:20:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-02 08:20:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 08:20:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-02 08:20:34,357 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-12-02 08:20:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:20:34,357 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-02 08:20:34,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:20:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-02 08:20:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:20:34,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:20:34,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:20:34,358 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:20:34,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1024399421, now seen corresponding path program 1 times [2018-12-02 08:20:34,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:20:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:20:34,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:20:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,496 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 08:20:34,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:20:34,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:20:34,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-02 08:20:34,497 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [29], [34], [41], [46], [48], [49], [52], [53], [56], [59], [67], [83], [84], [85], [87] [2018-12-02 08:20:34,519 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:20:34,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:20:34,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:20:34,645 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 192 root evaluator evaluations with a maximum evaluation depth of 3. Performed 192 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-02 08:20:34,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:20:34,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:20:34,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:20:34,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:20:34,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:20:34,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:20:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:20:34,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:20:34,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:20:34,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 08:20:34,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:20:34,755 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 08:20:34,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 08:20:34,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-02 08:20:34,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:20:34,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:34,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 08:20:34,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-12-02 08:20:36,972 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-02 08:20:37,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2018-12-02 08:20:37,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-02 08:20:37,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,102 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-02 08:20:37,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,129 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-02 08:20:37,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-12-02 08:20:37,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 08:20:37,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,206 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-02 08:20:37,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 08:20:37,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,249 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-12-02 08:20:37,249 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:20:37,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,283 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-12-02 08:20:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:20:37,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:20:37,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 08:20:37,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-12-02 08:20:37,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 08:20:37,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:20:37,648 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-12-02 08:20:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:20:37,666 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 08:20:37,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [11] total 34 [2018-12-02 08:20:37,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:20:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 08:20:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 08:20:37,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 08:20:37,667 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 15 states. [2018-12-02 08:20:41,049 WARN L180 SmtUtils]: Spent 3.28 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 08:20:44,127 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-02 08:20:48,776 WARN L180 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-02 08:21:00,865 WARN L180 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-02 08:21:10,339 WARN L180 SmtUtils]: Spent 9.45 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-12-02 08:21:18,003 WARN L180 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-02 08:21:26,913 WARN L180 SmtUtils]: Spent 8.88 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-02 08:21:35,754 WARN L180 SmtUtils]: Spent 8.81 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-02 08:21:41,441 WARN L180 SmtUtils]: Spent 5.65 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-02 08:21:43,905 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 08:21:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:21:43,944 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-02 08:21:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 08:21:43,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-12-02 08:21:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:21:43,945 INFO L225 Difference]: With dead ends: 92 [2018-12-02 08:21:43,945 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 08:21:43,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 68.8s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 08:21:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 08:21:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2018-12-02 08:21:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 08:21:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-02 08:21:43,948 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-12-02 08:21:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:21:43,948 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-02 08:21:43,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 08:21:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-02 08:21:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:21:43,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:21:43,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:21:43,948 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:21:43,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash -563948481, now seen corresponding path program 1 times [2018-12-02 08:21:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:21:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:43,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:21:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:44,077 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 08:21:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:44,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:21:44,078 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-02 08:21:44,078 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [34], [41], [46], [48], [49], [52], [53], [56], [59], [67], [83], [84], [85], [87] [2018-12-02 08:21:44,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:21:44,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:21:44,117 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:21:44,118 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 190 root evaluator evaluations with a maximum evaluation depth of 3. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-02 08:21:44,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:44,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:21:44,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:44,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:21:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:44,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:21:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:44,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:21:44,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:44,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:44,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:44,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 08:21:44,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 08:21:44,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:44,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 08:21:44,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:21:44,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:21:44,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 08:21:44,307 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 08:21:44,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:21:44,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 08:21:44,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 08:21:44,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 08:21:44,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:44,506 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 08:21:44,510 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 08:21:44,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:21:44,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-02 08:21:44,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:21:44,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 08:21:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 08:21:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-02 08:21:44,535 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 19 states. [2018-12-02 08:21:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:21:45,641 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-12-02 08:21:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 08:21:45,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-02 08:21:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:21:45,642 INFO L225 Difference]: With dead ends: 81 [2018-12-02 08:21:45,642 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 08:21:45,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 08:21:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 08:21:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-12-02 08:21:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 08:21:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-02 08:21:45,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 23 [2018-12-02 08:21:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:21:45,644 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-02 08:21:45,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 08:21:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-02 08:21:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:21:45,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:21:45,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:21:45,645 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:21:45,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 900297741, now seen corresponding path program 1 times [2018-12-02 08:21:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:21:45,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:45,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:21:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:21:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:21:45,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:21:45,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:21:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:21:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:21:45,706 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 8 states. [2018-12-02 08:21:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:21:45,763 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-12-02 08:21:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:21:45,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-02 08:21:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:21:45,764 INFO L225 Difference]: With dead ends: 61 [2018-12-02 08:21:45,764 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 08:21:45,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:21:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 08:21:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-02 08:21:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-02 08:21:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-02 08:21:45,766 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 25 [2018-12-02 08:21:45,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:21:45,766 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-02 08:21:45,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:21:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-12-02 08:21:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:21:45,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:21:45,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:21:45,767 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:21:45,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:45,767 INFO L82 PathProgramCache]: Analyzing trace with hash -788646001, now seen corresponding path program 1 times [2018-12-02 08:21:45,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:21:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:45,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:45,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:21:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:46,012 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 08:21:46,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:46,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:21:46,012 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-02 08:21:46,013 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [34], [36], [41], [46], [49], [52], [53], [56], [59], [65], [71], [77], [83], [84], [85], [87] [2018-12-02 08:21:46,014 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:21:46,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:21:46,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:21:46,045 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 3. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-02 08:21:46,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:46,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:21:46,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:46,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:21:46,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:46,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:21:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:46,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:21:46,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:21:46,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 08:21:46,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:46,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:46,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:46,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 08:21:46,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 08:21:46,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:46,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:46,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-02 08:21:46,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-02 08:21:46,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:46,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 08:21:46,233 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-02 08:21:46,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:21:46,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:21:46,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:48 [2018-12-02 08:21:46,335 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 08:21:46,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:21:46,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 08:21:46,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 08:21:46,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 08:21:46,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:46,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-02 08:21:46,586 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 08:21:46,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:21:46,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2018-12-02 08:21:46,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:21:46,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 08:21:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 08:21:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-12-02 08:21:46,602 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 21 states. [2018-12-02 08:21:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:21:47,778 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2018-12-02 08:21:47,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:21:47,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-02 08:21:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:21:47,779 INFO L225 Difference]: With dead ends: 112 [2018-12-02 08:21:47,779 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 08:21:47,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=1202, Unknown=1, NotChecked=0, Total=1406 [2018-12-02 08:21:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 08:21:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 73. [2018-12-02 08:21:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 08:21:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-12-02 08:21:47,781 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 25 [2018-12-02 08:21:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:21:47,781 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-12-02 08:21:47,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 08:21:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-12-02 08:21:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:21:47,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:21:47,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:21:47,782 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:21:47,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1941209659, now seen corresponding path program 1 times [2018-12-02 08:21:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:21:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:47,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:21:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:47,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:47,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:21:47,971 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 08:21:47,971 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [34], [41], [46], [49], [52], [53], [56], [58], [59], [67], [83], [84], [85], [87] [2018-12-02 08:21:47,972 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:21:47,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:21:47,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:21:47,992 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 190 root evaluator evaluations with a maximum evaluation depth of 3. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-02 08:21:47,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:47,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:21:47,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:47,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:21:48,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:48,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:21:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:48,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:21:48,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:21:48,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 08:21:48,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:48,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:48,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:48,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 08:21:48,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 08:21:48,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:48,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:48,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:48,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 08:21:48,858 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 08:21:48,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-02 08:21:48,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-12-02 08:21:48,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-02 08:21:49,013 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-02 08:21:49,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:49,065 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-12-02 08:21:49,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:49,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2018-12-02 08:21:49,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-02 08:21:49,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-02 08:21:49,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:49,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-12-02 08:21:49,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 08:21:49,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-02 08:21:49,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:49,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-02 08:21:49,367 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 08:21:49,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 08:21:49,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:21:49,455 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-02 08:21:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:49,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:21:50,106 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 11 [2018-12-02 08:21:50,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 08:21:50,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-02 08:21:50,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-02 08:21:50,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-02 08:21:50,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:50,175 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-02 08:21:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:50,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:21:50,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2018-12-02 08:21:50,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:21:50,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 08:21:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 08:21:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 08:21:50,195 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 27 states. [2018-12-02 08:21:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:21:54,786 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-02 08:21:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 08:21:54,786 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-02 08:21:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:21:54,786 INFO L225 Difference]: With dead ends: 86 [2018-12-02 08:21:54,786 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 08:21:54,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=415, Invalid=2447, Unknown=0, NotChecked=0, Total=2862 [2018-12-02 08:21:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 08:21:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-12-02 08:21:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 08:21:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2018-12-02 08:21:54,788 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 27 [2018-12-02 08:21:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:21:54,789 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2018-12-02 08:21:54,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 08:21:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2018-12-02 08:21:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 08:21:54,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:21:54,789 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:21:54,789 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:21:54,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:21:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1157688613, now seen corresponding path program 2 times [2018-12-02 08:21:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:21:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:21:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:21:54,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:21:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:21:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:54,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:21:54,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:21:54,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:21:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:21:54,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/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 08:21:54,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 08:21:54,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 08:21:54,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 08:21:54,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:21:54,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:21:54,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 08:21:54,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 08:21:54,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:54,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:21:54,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 08:21:56,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-12-02 08:21:56,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 58 [2018-12-02 08:21:56,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 14 xjuncts. [2018-12-02 08:21:56,567 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-12-02 08:21:56,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:56,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2018-12-02 08:21:56,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 08:21:56,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:21:56,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:21:56,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:62, output treesize:119 [2018-12-02 08:21:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:56,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:21:57,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 08:21:57,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:57,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 08:21:57,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 08:21:57,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:21:57,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:57,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:21:57,286 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:10 [2018-12-02 08:21:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:21:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:21:57,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 42 [2018-12-02 08:21:57,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:21:57,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 08:21:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 08:21:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1606, Unknown=2, NotChecked=0, Total=1806 [2018-12-02 08:21:57,312 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 28 states. [2018-12-02 08:22:01,543 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-02 08:22:01,862 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-12-02 08:22:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:22:05,000 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-02 08:22:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 08:22:05,001 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-12-02 08:22:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:22:05,001 INFO L225 Difference]: With dead ends: 86 [2018-12-02 08:22:05,001 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 08:22:05,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=893, Invalid=3661, Unknown=2, NotChecked=0, Total=4556 [2018-12-02 08:22:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 08:22:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2018-12-02 08:22:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 08:22:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-02 08:22:05,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-12-02 08:22:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:22:05,003 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-02 08:22:05,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 08:22:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-02 08:22:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 08:22:05,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:22:05,004 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:22:05,004 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:22:05,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:22:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2090701946, now seen corresponding path program 1 times [2018-12-02 08:22:05,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:22:05,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:22:05,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:22:05,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:22:05,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:22:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:22:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:22:05,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:22:05,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:22:05,044 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-02 08:22:05,045 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [34], [41], [46], [49], [52], [53], [56], [58], [59], [65], [71], [77], [83], [84], [85], [87] [2018-12-02 08:22:05,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:22:05,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:22:05,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:22:05,063 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 194 root evaluator evaluations with a maximum evaluation depth of 3. Performed 194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-02 08:22:05,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:22:05,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:22:05,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:22:05,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:22:05,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:22:05,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:22:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:22:05,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:22:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:22:05,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:22:05,104 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 8 treesize of output 6 [2018-12-02 08:22:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-02 08:22:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:22:05,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:22:05,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2018-12-02 08:22:05,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:22:05,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:22:05,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:22:05,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:22:05,128 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 9 states. [2018-12-02 08:22:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:22:05,188 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-02 08:22:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:22:05,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-02 08:22:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:22:05,189 INFO L225 Difference]: With dead ends: 63 [2018-12-02 08:22:05,189 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 08:22:05,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-02 08:22:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 08:22:05,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-12-02 08:22:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 08:22:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-12-02 08:22:05,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 31 [2018-12-02 08:22:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:22:05,190 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-12-02 08:22:05,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:22:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-12-02 08:22:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 08:22:05,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:22:05,191 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:22:05,191 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:22:05,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:22:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash -758729813, now seen corresponding path program 2 times [2018-12-02 08:22:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:22:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:22:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:22:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:22:05,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:22:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:22:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:22:05,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:22:05,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:22:05,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:22:05,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:22:05,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:22:05,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:22:05,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 08:22:05,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 08:22:05,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 08:22:05,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:22:05,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:22:05,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:22:05,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 08:22:05,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 08:22:05,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,536 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 08:22:05,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 08:22:05,556 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 13 treesize of output 12 [2018-12-02 08:22:05,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:22:05,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 08:22:05,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 08:22:05,584 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 13 treesize of output 12 [2018-12-02 08:22:05,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:05,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 08:22:05,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-02 08:22:07,827 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 08:22:07,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-12-02 08:22:07,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 61 [2018-12-02 08:22:07,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-02 08:22:08,033 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-12-02 08:22:08,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:08,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-12-02 08:22:08,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:08,135 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-02 08:22:08,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:08,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-12-02 08:22:08,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 08:22:08,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-02 08:22:08,238 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:08,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 08:22:08,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:08,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-12-02 08:22:08,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 08:22:08,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-12-02 08:22:08,354 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-02 08:22:08,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 08:22:08,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 08:22:08,440 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-12-02 08:22:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:22:08,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:22:09,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 08:22:09,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-02 08:22:09,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:09,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-02 08:22:09,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:09,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-02 08:22:09,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:22:09,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:09,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:22:09,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2018-12-02 08:22:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 08:22:09,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:22:09,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 39 [2018-12-02 08:22:09,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:22:09,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 08:22:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 08:22:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 08:22:09,231 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 28 states. [2018-12-02 08:22:11,804 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-12-02 08:22:12,971 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-12-02 08:22:17,111 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2018-12-02 08:22:19,236 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2018-12-02 08:22:21,390 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-12-02 08:22:23,572 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2018-12-02 08:22:25,931 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-12-02 08:22:28,090 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-12-02 08:22:28,270 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-12-02 08:22:28,790 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-12-02 08:22:29,174 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2018-12-02 08:22:32,426 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-12-02 08:22:32,803 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 74 [2018-12-02 08:22:38,616 WARN L180 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-02 08:22:41,001 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2018-12-02 08:22:44,004 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-12-02 08:22:44,519 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-12-02 08:22:44,935 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-02 08:22:49,206 WARN L180 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-12-02 08:22:52,557 WARN L180 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-02 08:22:57,397 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2018-12-02 08:23:01,942 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-12-02 08:23:02,174 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2018-12-02 08:23:06,067 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-02 08:23:06,502 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2018-12-02 08:23:08,732 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-02 08:23:20,134 WARN L180 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-12-02 08:23:21,665 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-12-02 08:23:22,035 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-12-02 08:23:22,225 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-02 08:23:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:22,421 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-12-02 08:23:22,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-02 08:23:22,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-12-02 08:23:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:22,423 INFO L225 Difference]: With dead ends: 83 [2018-12-02 08:23:22,423 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 08:23:22,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 75.2s TimeCoverageRelationStatistics Valid=1511, Invalid=7407, Unknown=12, NotChecked=0, Total=8930 [2018-12-02 08:23:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 08:23:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 37. [2018-12-02 08:23:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 08:23:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-02 08:23:22,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-12-02 08:23:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:22,427 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-02 08:23:22,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 08:23:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-02 08:23:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 08:23:22,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:22,428 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:22,428 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:23:22,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash 987922784, now seen corresponding path program 2 times [2018-12-02 08:23:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:23:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:22,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:23:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:22,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:23:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:22,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:22,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:23:22,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:23:22,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:23:22,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:22,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:23:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 08:23:22,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 08:23:22,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 08:23:22,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:23:22,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:22,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:22,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 08:23:22,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 08:23:22,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 08:23:22,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 08:23:22,630 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 13 treesize of output 12 [2018-12-02 08:23:22,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-02 08:23:22,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 08:23:22,657 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 13 treesize of output 12 [2018-12-02 08:23:22,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-02 08:23:22,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-02 08:23:22,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 08:23:22,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 08:23:22,742 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-02 08:23:22,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:22,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:22,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-02 08:23:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:22,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:23:22,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-02 08:23:23,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:23:23,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2018-12-02 08:23:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:23,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:23:23,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2018-12-02 08:23:23,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:23:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 08:23:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 08:23:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-12-02 08:23:23,059 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 20 states. [2018-12-02 08:23:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:23,681 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-02 08:23:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:23:23,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-02 08:23:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:23,681 INFO L225 Difference]: With dead ends: 67 [2018-12-02 08:23:23,681 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 08:23:23,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 08:23:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 08:23:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2018-12-02 08:23:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 08:23:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-02 08:23:23,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2018-12-02 08:23:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:23,683 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-02 08:23:23,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 08:23:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-02 08:23:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 08:23:23,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:23,683 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:23,683 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION]=== [2018-12-02 08:23:23,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1789827823, now seen corresponding path program 3 times [2018-12-02 08:23:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:23:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:23,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:23:23,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:23,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:23:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 08:23:23,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:23,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:23:23,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:23:23,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:23:23,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:23,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:23:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 08:23:23,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 08:23:23,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 08:23:23,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:23:23,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:23,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:23,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 08:23:23,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 08:23:23,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,844 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 08:23:23,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 08:23:23,862 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 12 treesize of output 11 [2018-12-02 08:23:23,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 08:23:23,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 08:23:23,890 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 13 treesize of output 12 [2018-12-02 08:23:23,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:23,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 08:23:24,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-02 08:23:24,005 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-02 08:23:24,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:24,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 08:23:24,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 08:23:24,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:24,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:24,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-12-02 08:23:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:24,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:23:24,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 08:23:24,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 08:23:24,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:24,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:24,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:24,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-02 08:23:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:24,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:23:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 30 [2018-12-02 08:23:24,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:23:24,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 08:23:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 08:23:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-12-02 08:23:24,391 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 21 states. [2018-12-02 08:23:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:25,134 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-02 08:23:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 08:23:25,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-12-02 08:23:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:25,135 INFO L225 Difference]: With dead ends: 57 [2018-12-02 08:23:25,135 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 08:23:25,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=410, Invalid=1570, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 08:23:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 08:23:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 08:23:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 08:23:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 08:23:25,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-12-02 08:23:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:25,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:23:25,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 08:23:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:23:25,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 08:23:25,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:23:25 BoogieIcfgContainer [2018-12-02 08:23:25,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:23:25,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:23:25,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:23:25,141 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:23:25,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:33" (3/4) ... [2018-12-02 08:23:25,144 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 08:23:25,148 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 08:23:25,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 08:23:25,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure substring [2018-12-02 08:23:25,152 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 08:23:25,152 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 08:23:25,152 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 08:23:25,176 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0e99cea-4e19-4bdb-9cdc-4e8f5c10a3b7/bin-2019/utaipan/witness.graphml [2018-12-02 08:23:25,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:23:25,177 INFO L168 Benchmark]: Toolchain (without parser) took 172546.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -84.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:25,177 INFO L168 Benchmark]: CDTParser took 0.18 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 08:23:25,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.4 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -95.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:25,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:25,178 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:25,178 INFO L168 Benchmark]: RCFGBuilder took 198.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:25,178 INFO L168 Benchmark]: TraceAbstraction took 172013.61 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -15.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:25,178 INFO L168 Benchmark]: Witness Printer took 35.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 84.2 kB). Peak memory consumption was 84.2 kB. Max. memory is 11.5 GB. [2018-12-02 08:23:25,179 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.18 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 255.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.4 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -95.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 198.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172013.61 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -15.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Witness Printer took 35.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 84.2 kB). Peak memory consumption was 84.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 15 error locations. SAFE Result, 171.9s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 156.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 629 SDtfs, 2108 SDslu, 2535 SDs, 0 SdLazy, 3953 SolverSat, 366 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 391 SyntacticMatches, 18 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4034 ImplicationChecksByTransitivity, 162.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=17, 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, 23 MinimizatonAttempts, 260 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 781 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1016 ConstructedInterpolants, 173 QuantifiedInterpolants, 441020 SizeOfPredicates, 183 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 41 InterpolantComputations, 16 PerfectInterpolantSequences, 52/273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...