./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_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:39:05,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:39:05,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:39:05,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:39:05,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:39:05,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:39:05,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:39:05,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:39:05,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:39:05,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:39:05,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:39:05,848 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:39:05,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:39:05,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:39:05,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:39:05,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:39:05,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:39:05,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:39:05,853 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:39:05,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:39:05,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:39:05,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:39:05,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:39:05,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:39:05,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:39:05,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:39:05,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:39:05,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:39:05,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:39:05,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:39:05,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:39:05,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:39:05,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:39:05,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:39:05,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:39:05,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:39:05,864 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 18:39:05,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:39:05,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:39:05,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:39:05,875 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:39:05,875 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:39:05,875 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:39:05,876 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:39:05,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 18:39:05,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 18:39:05,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:39:05,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 18:39:05,878 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 18:39:05,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:39:05,879 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:39:05,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:39:05,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:39:05,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:39:05,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:39:05,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:39:05,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:39:05,880 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:39:05,880 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:39:05,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:39:05,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:39:05,880 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_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:39:05,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:39:05,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:39:05,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:39:05,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:39:05,913 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:39:05,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:39:05,947 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/data/6ad286cec/9bf5069254e4425da64670581b779adf/FLAG64e4fc829 [2018-12-09 18:39:06,382 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:39:06,382 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:39:06,389 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/data/6ad286cec/9bf5069254e4425da64670581b779adf/FLAG64e4fc829 [2018-12-09 18:39:06,397 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/data/6ad286cec/9bf5069254e4425da64670581b779adf [2018-12-09 18:39:06,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:39:06,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:39:06,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:39:06,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:39:06,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:39:06,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178df10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06, skipping insertion in model container [2018-12-09 18:39:06,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:39:06,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:39:06,563 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:39:06,569 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:39:06,601 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:39:06,620 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:39:06,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06 WrapperNode [2018-12-09 18:39:06,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:39:06,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:39:06,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:39:06,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:39:06,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:39:06,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:39:06,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:39:06,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:39:06,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... [2018-12-09 18:39:06,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:39:06,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:39:06,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:39:06,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:39:06,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:39:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:39:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 18:39:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:39:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:39:06,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:39:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:39:06,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:39:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 18:39:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2018-12-09 18:39:06,710 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2018-12-09 18:39:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:39:06,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:39:06,850 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:39:06,851 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 18:39:06,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:06 BoogieIcfgContainer [2018-12-09 18:39:06,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:39:06,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:39:06,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:39:06,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:39:06,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:39:06" (1/3) ... [2018-12-09 18:39:06,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179bd993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:39:06, skipping insertion in model container [2018-12-09 18:39:06,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:39:06" (2/3) ... [2018-12-09 18:39:06,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179bd993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:39:06, skipping insertion in model container [2018-12-09 18:39:06,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:06" (3/3) ... [2018-12-09 18:39:06,856 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:39:06,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:39:06,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 18:39:06,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 18:39:06,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:39:06,889 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 18:39:06,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:39:06,890 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:39:06,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:39:06,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:39:06,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:39:06,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:39:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 18:39:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 18:39:06,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:06,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:06,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:06,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash 494354843, now seen corresponding path program 1 times [2018-12-09 18:39:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:06,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:06,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:06,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:06,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,018 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-09 18:39:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 18:39:07,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:39:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:39:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:39:07,031 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-09 18:39:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,075 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-09 18:39:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:39:07,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 18:39:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,082 INFO L225 Difference]: With dead ends: 46 [2018-12-09 18:39:07,082 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 18:39:07,083 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-09 18:39:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 18:39:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 18:39:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 18:39:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 18:39:07,105 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-09 18:39:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 18:39:07,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:39:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 18:39:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 18:39:07,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 494354844, now seen corresponding path program 1 times [2018-12-09 18:39:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,150 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-09 18:39:07,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:39:07,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:39:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:39:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:39:07,152 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 18:39:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,170 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 18:39:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:39:07,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 18:39:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,171 INFO L225 Difference]: With dead ends: 42 [2018-12-09 18:39:07,171 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 18:39:07,172 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-09 18:39:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 18:39:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 18:39:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 18:39:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 18:39:07,175 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-09 18:39:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,175 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 18:39:07,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:39:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 18:39:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 18:39:07,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1854869059, now seen corresponding path program 1 times [2018-12-09 18:39:07,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,199 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-09 18:39:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 18:39:07,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:39:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:39:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:39:07,200 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-09 18:39:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,222 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-09 18:39:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:39:07,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 18:39:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,222 INFO L225 Difference]: With dead ends: 41 [2018-12-09 18:39:07,222 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 18:39:07,223 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-09 18:39:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 18:39:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 18:39:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 18:39:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 18:39:07,225 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-09 18:39:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,225 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 18:39:07,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:39:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 18:39:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 18:39:07,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,226 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1854869058, now seen corresponding path program 1 times [2018-12-09 18:39:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,263 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-09 18:39:07,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:39:07,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:39:07,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:39:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:39:07,264 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-09 18:39:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,274 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 18:39:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:39:07,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 18:39:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,275 INFO L225 Difference]: With dead ends: 40 [2018-12-09 18:39:07,275 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 18:39:07,275 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-09 18:39:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 18:39:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 18:39:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 18:39:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 18:39:07,277 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-09 18:39:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,278 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 18:39:07,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:39:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 18:39:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:39:07,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,278 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash 645148417, now seen corresponding path program 1 times [2018-12-09 18:39:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,301 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-09 18:39:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:39:07,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:39:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:39:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:39:07,301 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-09 18:39:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,336 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-09 18:39:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:39:07,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 18:39:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,337 INFO L225 Difference]: With dead ends: 39 [2018-12-09 18:39:07,337 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 18:39:07,337 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-09 18:39:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 18:39:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 18:39:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 18:39:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-09 18:39:07,339 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-12-09 18:39:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,339 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 18:39:07,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:39:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-09 18:39:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:39:07,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,340 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,340 INFO L82 PathProgramCache]: Analyzing trace with hash 645148418, now seen corresponding path program 1 times [2018-12-09 18:39:07,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,390 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-09 18:39:07,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:39:07,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:39:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:39:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:39:07,390 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-09 18:39:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,458 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-09 18:39:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:39:07,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 18:39:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,460 INFO L225 Difference]: With dead ends: 61 [2018-12-09 18:39:07,460 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 18:39:07,461 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-09 18:39:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 18:39:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-12-09 18:39:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 18:39:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 18:39:07,464 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 18:39:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,464 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 18:39:07,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:39:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 18:39:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:39:07,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,465 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1512338471, now seen corresponding path program 1 times [2018-12-09 18:39:07,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,531 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-09 18:39:07,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:39:07,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:39:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:39:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:39:07,532 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2018-12-09 18:39:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,614 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-12-09 18:39:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:39:07,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 18:39:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,615 INFO L225 Difference]: With dead ends: 60 [2018-12-09 18:39:07,615 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 18:39:07,615 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-09 18:39:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 18:39:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2018-12-09 18:39:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 18:39:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-12-09 18:39:07,618 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 16 [2018-12-09 18:39:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,618 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-12-09 18:39:07,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:39:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-12-09 18:39:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:39:07,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:07,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1512338470, now seen corresponding path program 1 times [2018-12-09 18:39:07,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,642 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-09 18:39:07,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:39:07,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:39:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:39:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:39:07,643 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 6 states. [2018-12-09 18:39:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,700 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-12-09 18:39:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:39:07,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 18:39:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,701 INFO L225 Difference]: With dead ends: 49 [2018-12-09 18:39:07,701 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 18:39:07,702 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-09 18:39:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 18:39:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-09 18:39:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 18:39:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-09 18:39:07,705 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2018-12-09 18:39:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,705 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-09 18:39:07,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:39:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-09 18:39:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:39:07,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,706 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-09 18:39:07,706 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash 192803602, now seen corresponding path program 1 times [2018-12-09 18:39:07,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,752 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-09 18:39:07,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:39:07,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:39:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:39:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:39:07,753 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-12-09 18:39:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,794 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 18:39:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:39:07,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 18:39:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,795 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:39:07,795 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 18:39:07,795 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-09 18:39:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 18:39:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 18:39:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 18:39:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-09 18:39:07,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2018-12-09 18:39:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,797 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-09 18:39:07,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:39:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-09 18:39:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:39:07,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,798 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-09 18:39:07,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash 216721836, now seen corresponding path program 1 times [2018-12-09 18:39:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,826 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-09 18:39:07,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:39:07,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:39:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:39:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:39:07,827 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-12-09 18:39:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,878 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-09 18:39:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:39:07,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 18:39:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,879 INFO L225 Difference]: With dead ends: 39 [2018-12-09 18:39:07,879 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 18:39:07,880 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-09 18:39:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 18:39:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-09 18:39:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 18:39:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-09 18:39:07,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-12-09 18:39:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,882 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 18:39:07,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:39:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-09 18:39:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:39:07,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,883 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-09 18:39:07,883 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash 216721837, now seen corresponding path program 1 times [2018-12-09 18:39:07,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:07,932 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-09 18:39:07,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:07,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:39:07,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:07,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:39:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:39:07,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:39:07,933 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-09 18:39:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:07,988 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-12-09 18:39:07,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:39:07,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 18:39:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:07,989 INFO L225 Difference]: With dead ends: 64 [2018-12-09 18:39:07,989 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 18:39:07,990 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-09 18:39:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 18:39:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-12-09 18:39:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 18:39:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 18:39:07,992 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 20 [2018-12-09 18:39:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:07,992 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 18:39:07,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:39:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 18:39:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:39:07,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:07,993 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-09 18:39:07,993 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:07,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 216730910, now seen corresponding path program 1 times [2018-12-09 18:39:07,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:07,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:07,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:07,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,007 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-09 18:39:08,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:08,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:39:08,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:08,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:39:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:39:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:39:08,008 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-12-09 18:39:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:08,012 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 18:39:08,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:39:08,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 18:39:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:08,013 INFO L225 Difference]: With dead ends: 46 [2018-12-09 18:39:08,013 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 18:39:08,013 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-09 18:39:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 18:39:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 18:39:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:39:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 18:39:08,015 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2018-12-09 18:39:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:08,015 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 18:39:08,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:39:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 18:39:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:39:08,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:08,015 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-09 18:39:08,016 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:08,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2119939246, now seen corresponding path program 1 times [2018-12-09 18:39:08,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:08,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,044 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-09 18:39:08,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:39:08,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:39:08,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:08,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:39:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:39:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:39:08,045 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-09 18:39:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:08,088 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-09 18:39:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:39:08,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 18:39:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:08,089 INFO L225 Difference]: With dead ends: 50 [2018-12-09 18:39:08,089 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 18:39:08,089 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-09 18:39:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 18:39:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-09 18:39:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:39:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-09 18:39:08,091 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-12-09 18:39:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:08,091 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-09 18:39:08,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:39:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-09 18:39:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:39:08,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:08,092 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-09 18:39:08,092 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:39:08,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1024399421, now seen corresponding path program 1 times [2018-12-09 18:39:08,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,227 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-09 18:39:08,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:08,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:08,228 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 18:39:08,229 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-09 18:39:08,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:39:08,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:39:08,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:39:08,352 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-09 18:39:08,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:08,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:39:08,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:08,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:39:08,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:08,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:39:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:08,434 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-09 18:39:08,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 18:39:08,462 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-09 18:39:08,464 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-09 18:39:08,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 18:39:08,488 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-09 18:39:08,490 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-09 18:39:08,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:39:08,500 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-09 18:39:08,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-12-09 18:39:10,686 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-09 18:39:10,762 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-09 18:39:10,769 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-09 18:39:10,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,805 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-09 18:39:10,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,837 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-09 18:39:10,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,869 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-09 18:39:10,869 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,904 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-09 18:39:10,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,929 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-09 18:39:10,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,953 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-09 18:39:10,954 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:10,994 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-09 18:39:10,995 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:11,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:39:11,027 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-09 18:39:11,027 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-12-09 18:39:11,061 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-09 18:39:11,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:11,365 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-09 18:39:11,392 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-09 18:39:11,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:11,402 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-09 18:39:11,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:39:11,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:39:11,409 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-09 18:39:11,409 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-12-09 18:39:11,413 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-09 18:39:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:39:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [11] total 34 [2018-12-09 18:39:11,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:39:11,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 18:39:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 18:39:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 18:39:11,428 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 15 states. [2018-12-09 18:39:13,420 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 18:39:17,826 WARN L180 SmtUtils]: Spent 4.37 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 18:39:21,203 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-09 18:39:30,994 WARN L180 SmtUtils]: Spent 9.75 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-09 18:39:40,556 WARN L180 SmtUtils]: Spent 9.54 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-12-09 18:39:47,932 WARN L180 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 18:39:56,333 WARN L180 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-09 18:40:05,232 WARN L180 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-09 18:40:09,979 WARN L180 SmtUtils]: Spent 4.72 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-09 18:40:12,633 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 18:40:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:12,677 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-09 18:40:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 18:40:12,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-12-09 18:40:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:12,677 INFO L225 Difference]: With dead ends: 92 [2018-12-09 18:40:12,678 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 18:40:12,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 63.8s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 18:40:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 18:40:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2018-12-09 18:40:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 18:40:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-09 18:40:12,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-12-09 18:40:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-09 18:40:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 18:40:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-09 18:40:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 18:40:12,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:12,682 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-09 18:40:12,682 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:12,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash -563948481, now seen corresponding path program 1 times [2018-12-09 18:40:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:12,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:12,789 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-09 18:40:12,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:12,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:12,789 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 18:40:12,789 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-09 18:40:12,790 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:40:12,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:40:12,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:40:12,816 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-09 18:40:12,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:12,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:40:12,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:12,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:12,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:40:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:12,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:12,844 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-09 18:40:12,846 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-09 18:40:12,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:12,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:12,851 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-09 18:40:12,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 18:40:12,915 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-09 18:40:12,919 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-09 18:40:12,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:12,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:40:12,930 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-09 18:40:12,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 18:40:12,989 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-09 18:40:12,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:13,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, 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-09 18:40:13,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:13,171 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-09 18:40:13,178 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-09 18:40:13,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:13,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:13,183 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-09 18:40:13,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 18:40:13,187 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-09 18:40:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-09 18:40:13,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 18:40:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 18:40:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-09 18:40:13,202 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 19 states. [2018-12-09 18:40:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:13,888 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-12-09 18:40:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 18:40:13,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-09 18:40:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:13,889 INFO L225 Difference]: With dead ends: 81 [2018-12-09 18:40:13,889 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 18:40:13,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 18:40:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 18:40:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-12-09 18:40:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 18:40:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-09 18:40:13,893 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 23 [2018-12-09 18:40:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:13,894 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-09 18:40:13,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 18:40:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-09 18:40:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:40:13,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:13,894 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-09 18:40:13,895 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:13,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 900297741, now seen corresponding path program 1 times [2018-12-09 18:40:13,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:13,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:13,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:13,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:13,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:13,956 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-09 18:40:13,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:40:13,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:40:13,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:40:13,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:40:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:40:13,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:40:13,957 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 8 states. [2018-12-09 18:40:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:14,008 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-12-09 18:40:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:40:14,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-09 18:40:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:14,009 INFO L225 Difference]: With dead ends: 61 [2018-12-09 18:40:14,009 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 18:40:14,009 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-09 18:40:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 18:40:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-09 18:40:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 18:40:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-12-09 18:40:14,011 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 25 [2018-12-09 18:40:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:14,011 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-12-09 18:40:14,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:40:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-12-09 18:40:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 18:40:14,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:14,012 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-09 18:40:14,012 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:14,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash -788646001, now seen corresponding path program 1 times [2018-12-09 18:40:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:14,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:14,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:14,259 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-09 18:40:14,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:14,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:14,259 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-09 18:40:14,259 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-09 18:40:14,260 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:40:14,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:40:14,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:40:14,282 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-09 18:40:14,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:14,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:40:14,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:14,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:14,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:40:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:14,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:14,314 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-09 18:40:14,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 18:40:14,336 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-09 18:40:14,338 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-09 18:40:14,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,345 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-09 18:40:14,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 18:40:14,374 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-09 18:40:14,376 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-09 18:40:14,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,386 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-09 18:40:14,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-09 18:40:14,474 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-09 18:40:14,479 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-09 18:40:14,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 18:40:14,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:40:14,497 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-09 18:40:14,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:48 [2018-12-09 18:40:14,600 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-09 18:40:14,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:14,821 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-09 18:40:14,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,827 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-09 18:40:14,834 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-09 18:40:14,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:14,840 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-09 18:40:14,840 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-09 18:40:14,864 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-09 18:40:14,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:14,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2018-12-09 18:40:14,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:14,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 18:40:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 18:40:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-12-09 18:40:14,879 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 21 states. [2018-12-09 18:40:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:15,505 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2018-12-09 18:40:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:40:15,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2018-12-09 18:40:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:15,506 INFO L225 Difference]: With dead ends: 112 [2018-12-09 18:40:15,506 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 18:40:15,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1202, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 18:40:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 18:40:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 73. [2018-12-09 18:40:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 18:40:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-12-09 18:40:15,509 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 25 [2018-12-09 18:40:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:15,509 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-12-09 18:40:15,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 18:40:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-12-09 18:40:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 18:40:15,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:15,510 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-09 18:40:15,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:15,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1941209659, now seen corresponding path program 1 times [2018-12-09 18:40:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:15,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:15,689 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-09 18:40:15,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:15,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:15,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 18:40:15,690 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-09 18:40:15,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:40:15,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:40:15,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:40:15,710 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-09 18:40:15,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:15,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:40:15,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:15,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:15,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:15,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:40:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:15,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:15,743 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-09 18:40:15,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 18:40:15,764 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-09 18:40:15,766 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-09 18:40:15,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,774 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-09 18:40:15,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 18:40:15,801 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-09 18:40:15,803 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-09 18:40:15,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:15,815 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-09 18:40:15,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 18:40:16,651 WARN L180 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 18:40:16,752 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-09 18:40:16,769 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-09 18:40:16,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 18:40:16,829 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-09 18:40:16,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:16,886 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-09 18:40:16,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:16,945 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-09 18:40:16,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 18:40:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-12-09 18:40:17,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,073 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-09 18:40:17,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:17,135 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-09 18:40:17,135 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,198 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-09 18:40:17,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:17,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 18:40:17,285 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-09 18:40:17,286 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-09 18:40:17,354 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-09 18:40:17,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:17,823 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-09 18:40:17,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,837 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-09 18:40:17,864 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-09 18:40:17,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,877 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-09 18:40:17,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,886 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-09 18:40:17,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:17,895 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-09 18:40:17,895 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-09 18:40:17,905 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-09 18:40:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2018-12-09 18:40:17,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 18:40:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 18:40:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 18:40:17,920 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 27 states. [2018-12-09 18:40:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:22,121 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-12-09 18:40:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 18:40:22,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-09 18:40:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:22,121 INFO L225 Difference]: With dead ends: 86 [2018-12-09 18:40:22,122 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 18:40:22,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=396, Invalid=2359, Unknown=1, NotChecked=0, Total=2756 [2018-12-09 18:40:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 18:40:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-12-09 18:40:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 18:40:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2018-12-09 18:40:22,124 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 27 [2018-12-09 18:40:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:22,124 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2018-12-09 18:40:22,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 18:40:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2018-12-09 18:40:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 18:40:22,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:22,125 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-09 18:40:22,125 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:22,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1157688613, now seen corresponding path program 2 times [2018-12-09 18:40:22,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:22,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:22,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:22,294 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-09 18:40:22,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:22,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:22,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:40:22,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:40:22,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:22,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:22,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:40:22,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:40:22,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:40:22,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:40:22,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:22,338 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-09 18:40:22,340 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-09 18:40:22,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:22,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:22,345 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-09 18:40:22,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 18:40:22,741 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 33 treesize of output 33 [2018-12-09 18:40:22,749 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 25 treesize of output 31 [2018-12-09 18:40:22,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 18:40:22,774 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 29 treesize of output 24 [2018-12-09 18:40:22,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:22,796 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 24 treesize of output 16 [2018-12-09 18:40:22,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:22,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 18:40:22,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:40:22,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:73 [2018-12-09 18:40:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:40:22,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:23,371 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-09 18:40:23,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:23,379 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-09 18:40:23,397 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-09 18:40:23,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:23,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:23,407 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-09 18:40:23,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:10 [2018-12-09 18:40:23,421 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-09 18:40:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 17] total 41 [2018-12-09 18:40:23,437 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:23,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 18:40:23,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 18:40:23,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1537, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 18:40:23,438 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 27 states. [2018-12-09 18:40:26,532 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-12-09 18:40:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:28,631 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-09 18:40:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 18:40:28,631 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2018-12-09 18:40:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:28,632 INFO L225 Difference]: With dead ends: 86 [2018-12-09 18:40:28,632 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 18:40:28,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=867, Invalid=3554, Unknown=1, NotChecked=0, Total=4422 [2018-12-09 18:40:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 18:40:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2018-12-09 18:40:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 18:40:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-09 18:40:28,634 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-12-09 18:40:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:28,634 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-09 18:40:28,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 18:40:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-09 18:40:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 18:40:28,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:28,635 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-09 18:40:28,635 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:28,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:28,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2090701946, now seen corresponding path program 1 times [2018-12-09 18:40:28,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:28,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:40:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:28,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:28,691 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-09 18:40:28,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:28,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:28,692 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 18:40:28,692 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-09 18:40:28,693 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:40:28,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:40:28,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:40:28,723 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-09 18:40:28,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:28,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:40:28,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:28,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:28,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:40:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:28,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:28,770 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-09 18:40:28,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:28,786 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-09 18:40:28,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:28,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:28,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 18:40:28,794 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-09 18:40:28,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:28,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2018-12-09 18:40:28,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:40:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:40:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:40:28,809 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 9 states. [2018-12-09 18:40:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:40:28,874 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-09 18:40:28,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:40:28,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-09 18:40:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:40:28,875 INFO L225 Difference]: With dead ends: 63 [2018-12-09 18:40:28,875 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 18:40:28,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-09 18:40:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 18:40:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-12-09 18:40:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 18:40:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-12-09 18:40:28,876 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 31 [2018-12-09 18:40:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:40:28,876 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-12-09 18:40:28,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:40:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-12-09 18:40:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 18:40:28,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:40:28,877 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-09 18:40:28,877 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:40:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:40:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -758729813, now seen corresponding path program 2 times [2018-12-09 18:40:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:40:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:28,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:40:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:40:28,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:40:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:40:29,146 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-09 18:40:29,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:29,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:40:29,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:40:29,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:40:29,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:40:29,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:40:29,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:40:29,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:40:29,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:40:29,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:40:29,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:40:29,187 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-09 18:40:29,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,192 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-09 18:40:29,194 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-09 18:40:29,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 18:40:29,217 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-09 18:40:29,219 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-09 18:40:29,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,226 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-09 18:40:29,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 18:40:29,248 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-09 18:40:29,249 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-09 18:40:29,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,267 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-09 18:40:29,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-09 18:40:29,758 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 18:40:29,869 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-09 18:40:29,872 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 49 treesize of output 42 [2018-12-09 18:40:29,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,906 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 28 [2018-12-09 18:40:29,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,935 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-09 18:40:29,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:29,967 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 28 treesize of output 26 [2018-12-09 18:40:29,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:30,003 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-09 18:40:30,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-09 18:40:30,052 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 41 treesize of output 39 [2018-12-09 18:40:30,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 18:40:30,114 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 57 [2018-12-09 18:40:30,115 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-09 18:40:30,181 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 35 treesize of output 27 [2018-12-09 18:40:30,182 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:30,183 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 29 treesize of output 21 [2018-12-09 18:40:30,183 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:30,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 18:40:30,269 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-09 18:40:30,269 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:67, output treesize:96 [2018-12-09 18:40:30,379 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-09 18:40:30,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:40:32,390 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-09 18:40:32,415 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-09 18:40:32,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:32,425 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-09 18:40:32,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:32,435 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-09 18:40:32,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:40:32,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:40:32,446 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-09 18:40:32,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2018-12-09 18:40:32,493 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-09 18:40:32,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:40:32,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 39 [2018-12-09 18:40:32,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:40:32,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 18:40:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 18:40:32,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 18:40:32,509 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 28 states. [2018-12-09 18:40:35,015 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2018-12-09 18:40:39,790 WARN L180 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-12-09 18:40:40,002 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2018-12-09 18:40:44,145 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2018-12-09 18:40:44,761 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-12-09 18:40:47,217 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2018-12-09 18:40:51,406 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2018-12-09 18:40:53,603 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-12-09 18:40:56,593 WARN L180 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2018-12-09 18:40:56,803 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2018-12-09 18:41:04,057 WARN L180 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-12-09 18:41:04,276 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-12-09 18:41:06,491 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 121 DAG size of output: 74 [2018-12-09 18:41:09,658 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-09 18:41:09,979 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2018-12-09 18:41:12,481 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-12-09 18:41:13,855 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2018-12-09 18:41:16,212 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-09 18:41:22,319 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2018-12-09 18:41:25,076 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-12-09 18:41:37,698 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2018-12-09 18:41:38,104 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2018-12-09 18:41:40,929 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2018-12-09 18:41:43,088 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2018-12-09 18:41:45,522 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-12-09 18:41:46,212 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-09 18:41:51,612 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-12-09 18:41:53,144 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-12-09 18:41:55,117 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-09 18:41:55,291 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2018-12-09 18:41:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:41:55,333 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-12-09 18:41:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-09 18:41:55,333 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-12-09 18:41:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:41:55,334 INFO L225 Difference]: With dead ends: 83 [2018-12-09 18:41:55,334 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 18:41:55,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 84.5s TimeCoverageRelationStatistics Valid=1509, Invalid=7407, Unknown=14, NotChecked=0, Total=8930 [2018-12-09 18:41:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 18:41:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 37. [2018-12-09 18:41:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 18:41:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-09 18:41:55,337 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-12-09 18:41:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:41:55,337 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-09 18:41:55,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 18:41:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-09 18:41:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 18:41:55,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:41:55,338 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-09 18:41:55,338 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:41:55,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:41:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 987922784, now seen corresponding path program 2 times [2018-12-09 18:41:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:41:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:41:55,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:41:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:41:55,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:41:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:41:55,488 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-09 18:41:55,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:41:55,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:41:55,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:41:55,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:41:55,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:41:55,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:41:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:41:55,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:41:55,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:41:55,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:41:55,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:41:55,524 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-09 18:41:55,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,529 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-09 18:41:55,531 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-09 18:41:55,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,537 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 18:41:55,549 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-09 18:41:55,550 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-09 18:41:55,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-09 18:41:55,571 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-09 18:41:55,573 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-09 18:41:55,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,581 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-09 18:41:55,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 18:41:55,657 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-09 18:41:55,662 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-09 18:41:55,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:41:55,667 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-09 18:41:55,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:41:55,674 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-09 18:41:55,674 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-12-09 18:41:55,742 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-09 18:41:55,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:41:55,921 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-09 18:41:55,928 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-09 18:41:55,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:55,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2018-12-09 18:41:55,963 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-09 18:41:55,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:41:55,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2018-12-09 18:41:55,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:41:55,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 18:41:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 18:41:55,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-12-09 18:41:55,978 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 20 states. [2018-12-09 18:41:57,338 WARN L180 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-12-09 18:41:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:41:57,429 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-12-09 18:41:57,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:41:57,429 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-09 18:41:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:41:57,430 INFO L225 Difference]: With dead ends: 67 [2018-12-09 18:41:57,430 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 18:41:57,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 18:41:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 18:41:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2018-12-09 18:41:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 18:41:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-09 18:41:57,431 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2018-12-09 18:41:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:41:57,431 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-09 18:41:57,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 18:41:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-09 18:41:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 18:41:57,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:41:57,432 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-09 18:41:57,432 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, substringErr4REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION]=== [2018-12-09 18:41:57,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:41:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1789827823, now seen corresponding path program 3 times [2018-12-09 18:41:57,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:41:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:41:57,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:41:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:41:57,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:41:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:41:57,533 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-09 18:41:57,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:41:57,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:41:57,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:41:57,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:41:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:41:57,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/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-09 18:41:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:41:57,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:41:57,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:41:57,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:41:57,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:41:57,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, 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-09 18:41:57,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,573 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-09 18:41:57,576 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-09 18:41:57,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,584 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 18:41:57,598 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-09 18:41:57,599 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-09 18:41:57,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 18:41:57,621 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-09 18:41:57,622 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-09 18:41:57,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,629 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-09 18:41:57,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 18:41:57,735 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-09 18:41:57,736 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-09 18:41:57,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:57,744 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-09 18:41:57,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:41:57,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:41:57,753 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-09 18:41:57,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-12-09 18:41:57,809 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-09 18:41:57,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:41:58,051 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-09 18:41:58,058 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-09 18:41:58,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:41:58,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:41:58,063 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-09 18:41:58,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-09 18:41:58,101 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-09 18:41:58,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:41:58,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 30 [2018-12-09 18:41:58,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:41:58,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 18:41:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 18:41:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-12-09 18:41:58,117 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 21 states. [2018-12-09 18:41:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:41:58,800 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-09 18:41:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 18:41:58,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-12-09 18:41:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:41:58,800 INFO L225 Difference]: With dead ends: 57 [2018-12-09 18:41:58,800 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 18:41:58,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=1570, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 18:41:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 18:41:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 18:41:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 18:41:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 18:41:58,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-12-09 18:41:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:41:58,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 18:41:58,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 18:41:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 18:41:58,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 18:41:58,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:41:58 BoogieIcfgContainer [2018-12-09 18:41:58,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:41:58,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:41:58,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:41:58,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:41:58,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:39:06" (3/4) ... [2018-12-09 18:41:58,807 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 18:41:58,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 18:41:58,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 18:41:58,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure substring [2018-12-09 18:41:58,814 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-09 18:41:58,814 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 18:41:58,814 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 18:41:58,847 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_54e418d6-db6d-481f-88ed-94ab8632f0ff/bin-2019/utaipan/witness.graphml [2018-12-09 18:41:58,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:41:58,848 INFO L168 Benchmark]: Toolchain (without parser) took 172449.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 947.0 MB in the beginning and 843.1 MB in the end (delta: 104.0 MB). Peak memory consumption was 425.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:58,848 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:41:58,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -74.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:58,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.83 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-12-09 18:41:58,849 INFO L168 Benchmark]: Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:41:58,849 INFO L168 Benchmark]: RCFGBuilder took 172.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:58,849 INFO L168 Benchmark]: TraceAbstraction took 171952.72 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 86.0 MB). Free memory was 1.2 GB in the beginning and 843.1 MB in the end (delta: 359.9 MB). Peak memory consumption was 445.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:41:58,849 INFO L168 Benchmark]: Witness Printer took 42.81 ms. Allocated memory is still 1.4 GB. Free memory is still 843.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:41:58,850 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -74.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.83 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 171952.72 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 86.0 MB). Free memory was 1.2 GB in the beginning and 843.1 MB in the end (delta: 359.9 MB). Peak memory consumption was 445.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.81 ms. Allocated memory is still 1.4 GB. Free memory is still 843.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: 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: 566]: 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 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: 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: 550]: 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, 157.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 624 SDtfs, 2064 SDslu, 2507 SDs, 0 SdLazy, 3905 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 892 GetRequests, 391 SyntacticMatches, 19 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3972 ImplicationChecksByTransitivity, 163.5s 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, 13.3s InterpolantComputationTime, 781 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1016 ConstructedInterpolants, 173 QuantifiedInterpolants, 440266 SizeOfPredicates, 183 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 41 InterpolantComputations, 16 PerfectInterpolantSequences, 54/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...