./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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 2552da43a16cb54d5090a24426eb170717bf5525 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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 2552da43a16cb54d5090a24426eb170717bf5525 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_99 term size 26 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:30:42,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:30:42,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:30:42,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:30:42,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:30:42,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:30:42,919 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:30:42,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:30:42,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:30:42,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:30:42,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:30:42,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:30:42,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:30:42,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:30:42,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:30:42,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:30:42,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:30:42,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:30:42,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:30:42,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:30:42,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:30:42,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:30:42,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:30:42,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:30:42,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:30:42,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:30:42,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:30:42,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:30:42,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:30:42,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:30:42,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:30:42,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:30:42,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:30:42,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:30:42,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:30:42,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:30:42,938 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 10:30:42,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:30:42,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:30:42,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:30:42,949 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:30:42,949 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:30:42,949 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:30:42,949 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:30:42,949 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:30:42,949 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:30:42,950 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:30:42,950 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:30:42,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:30:42,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:30:42,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:30:42,951 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:30:42,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:30:42,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:30:42,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:30:42,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:30:42,953 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_54e801c9-c400-4859-ae28-d7ebef6aa59e/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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-11-10 10:30:42,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:30:42,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:30:42,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:30:42,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:30:42,988 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:30:42,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-10 10:30:43,028 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/982ff7927/b614492214094f2bbc8eb2e1b10763e5/FLAG69e6d2518 [2018-11-10 10:30:43,413 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:30:43,413 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-10 10:30:43,423 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/982ff7927/b614492214094f2bbc8eb2e1b10763e5/FLAG69e6d2518 [2018-11-10 10:30:43,435 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/982ff7927/b614492214094f2bbc8eb2e1b10763e5 [2018-11-10 10:30:43,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:30:43,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:30:43,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:30:43,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:30:43,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:30:43,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff31fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43, skipping insertion in model container [2018-11-10 10:30:43,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:30:43,476 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:30:43,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:30:43,681 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:30:43,713 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:30:43,736 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:30:43,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43 WrapperNode [2018-11-10 10:30:43,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:30:43,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:30:43,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:30:43,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:30:43,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:30:43,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:30:43,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:30:43,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:30:43,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... [2018-11-10 10:30:43,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:30:43,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:30:43,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:30:43,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:30:43,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:30:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:30:43,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:30:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:30:43,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:30:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:30:43,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:30:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-10 10:30:43,889 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-10 10:30:44,317 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:30:44,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:30:44 BoogieIcfgContainer [2018-11-10 10:30:44,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:30:44,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:30:44,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:30:44,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:30:44,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:30:43" (1/3) ... [2018-11-10 10:30:44,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493b6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:44, skipping insertion in model container [2018-11-10 10:30:44,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:43" (2/3) ... [2018-11-10 10:30:44,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493b6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:44, skipping insertion in model container [2018-11-10 10:30:44,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:30:44" (3/3) ... [2018-11-10 10:30:44,322 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-11-10 10:30:44,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:30:44,333 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-10 10:30:44,341 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-10 10:30:44,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:30:44,364 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 10:30:44,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:30:44,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:30:44,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:30:44,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:30:44,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:30:44,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:30:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-10 10:30:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 10:30:44,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:44,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:44,385 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:44,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1984049023, now seen corresponding path program 1 times [2018-11-10 10:30:44,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:44,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:44,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:30:44,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:44,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:44,499 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-10 10:30:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:44,668 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-11-10 10:30:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:44,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-10 10:30:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:44,676 INFO L225 Difference]: With dead ends: 141 [2018-11-10 10:30:44,677 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 10:30:44,678 INFO L605 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-11-10 10:30:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 10:30:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-10 10:30:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 10:30:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2018-11-10 10:30:44,711 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 7 [2018-11-10 10:30:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:44,711 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2018-11-10 10:30:44,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2018-11-10 10:30:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 10:30:44,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:44,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:44,713 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1375977608, now seen corresponding path program 1 times [2018-11-10 10:30:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:44,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:44,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:30:44,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:44,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:44,770 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 3 states. [2018-11-10 10:30:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:44,850 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-11-10 10:30:44,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:44,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 10:30:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:44,852 INFO L225 Difference]: With dead ends: 134 [2018-11-10 10:30:44,852 INFO L226 Difference]: Without dead ends: 134 [2018-11-10 10:30:44,852 INFO L605 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-11-10 10:30:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-10 10:30:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-11-10 10:30:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-10 10:30:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-11-10 10:30:44,860 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-11-10 10:30:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:44,861 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-11-10 10:30:44,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-11-10 10:30:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:30:44,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:44,861 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:44,862 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:44,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash -294367071, now seen corresponding path program 1 times [2018-11-10 10:30:44,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:44,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:44,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:30:44,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:44,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:30:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:30:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:44,932 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 5 states. [2018-11-10 10:30:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,088 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-10 10:30:45,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:30:45,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 10:30:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,089 INFO L225 Difference]: With dead ends: 135 [2018-11-10 10:30:45,089 INFO L226 Difference]: Without dead ends: 135 [2018-11-10 10:30:45,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:30:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-10 10:30:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-11-10 10:30:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 10:30:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-11-10 10:30:45,096 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 9 [2018-11-10 10:30:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,096 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-11-10 10:30:45,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:30:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-11-10 10:30:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:30:45,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,098 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -535444566, now seen corresponding path program 1 times [2018-11-10 10:30:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:45,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:30:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:30:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:30:45,145 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 4 states. [2018-11-10 10:30:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,229 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-11-10 10:30:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:30:45,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-10 10:30:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,231 INFO L225 Difference]: With dead ends: 132 [2018-11-10 10:30:45,231 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 10:30:45,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-10 10:30:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 10:30:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 10:30:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 10:30:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-11-10 10:30:45,237 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 10 [2018-11-10 10:30:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,237 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-11-10 10:30:45,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:30:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-11-10 10:30:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 10:30:45,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,239 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 79516389, now seen corresponding path program 1 times [2018-11-10 10:30:45,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,240 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:30:45,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:30:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:30:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:45,291 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 5 states. [2018-11-10 10:30:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,389 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-11-10 10:30:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:30:45,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 10:30:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,391 INFO L225 Difference]: With dead ends: 133 [2018-11-10 10:30:45,391 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 10:30:45,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 10:30:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-10 10:30:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 10:30:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2018-11-10 10:30:45,397 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 13 [2018-11-10 10:30:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,397 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2018-11-10 10:30:45,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:30:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-11-10 10:30:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:30:45,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,400 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1829959186, now seen corresponding path program 1 times [2018-11-10 10:30:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:45,448 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:30:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:30:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:30:45,449 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 4 states. [2018-11-10 10:30:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,532 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-11-10 10:30:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:30:45,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-10 10:30:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,533 INFO L225 Difference]: With dead ends: 132 [2018-11-10 10:30:45,533 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 10:30:45,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 10:30:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-10 10:30:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 10:30:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-11-10 10:30:45,541 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 14 [2018-11-10 10:30:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,542 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-11-10 10:30:45,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:30:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-10 10:30:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 10:30:45,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,543 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash -529089576, now seen corresponding path program 1 times [2018-11-10 10:30:45,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:30:45,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:45,583 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 3 states. [2018-11-10 10:30:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,657 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-11-10 10:30:45,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:45,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 10:30:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,657 INFO L225 Difference]: With dead ends: 129 [2018-11-10 10:30:45,658 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 10:30:45,658 INFO L605 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-11-10 10:30:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 10:30:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-10 10:30:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 10:30:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-11-10 10:30:45,663 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 18 [2018-11-10 10:30:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,664 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-11-10 10:30:45,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-11-10 10:30:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 10:30:45,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,665 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 778092487, now seen corresponding path program 1 times [2018-11-10 10:30:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:30:45,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:45,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:45,692 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 3 states. [2018-11-10 10:30:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:45,752 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-10 10:30:45,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:45,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 10:30:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:45,754 INFO L225 Difference]: With dead ends: 128 [2018-11-10 10:30:45,754 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 10:30:45,755 INFO L605 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-11-10 10:30:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 10:30:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-10 10:30:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 10:30:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-11-10 10:30:45,758 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 19 [2018-11-10 10:30:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:45,759 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-11-10 10:30:45,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-10 10:30:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:30:45,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:45,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:45,763 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1648936518, now seen corresponding path program 1 times [2018-11-10 10:30:45,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:45,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:45,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:45,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:30:45,900 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:45,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:30:45,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:30:45,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:30:45,901 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 9 states. [2018-11-10 10:30:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:46,254 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-11-10 10:30:46,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:30:46,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-10 10:30:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:46,255 INFO L225 Difference]: With dead ends: 225 [2018-11-10 10:30:46,255 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 10:30:46,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:30:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 10:30:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2018-11-10 10:30:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 10:30:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2018-11-10 10:30:46,259 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 20 [2018-11-10 10:30:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:46,259 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2018-11-10 10:30:46,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:30:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2018-11-10 10:30:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:30:46,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:46,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:46,260 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:46,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:46,260 INFO L82 PathProgramCache]: Analyzing trace with hash 422575657, now seen corresponding path program 1 times [2018-11-10 10:30:46,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:46,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:30:46,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:46,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:30:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:30:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:30:46,380 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand 9 states. [2018-11-10 10:30:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:46,701 INFO L93 Difference]: Finished difference Result 249 states and 260 transitions. [2018-11-10 10:30:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:30:46,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-10 10:30:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:46,705 INFO L225 Difference]: With dead ends: 249 [2018-11-10 10:30:46,705 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 10:30:46,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:30:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 10:30:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 188. [2018-11-10 10:30:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 10:30:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2018-11-10 10:30:46,710 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 21 [2018-11-10 10:30:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:46,710 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2018-11-10 10:30:46,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:30:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2018-11-10 10:30:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:30:46,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:46,711 INFO L375 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] [2018-11-10 10:30:46,712 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:46,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash 402418015, now seen corresponding path program 1 times [2018-11-10 10:30:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:46,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:46,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:46,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:46,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:30:46,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:46,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:30:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:30:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:30:46,892 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand 10 states. [2018-11-10 10:30:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,258 INFO L93 Difference]: Finished difference Result 246 states and 257 transitions. [2018-11-10 10:30:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:30:47,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-10 10:30:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,260 INFO L225 Difference]: With dead ends: 246 [2018-11-10 10:30:47,260 INFO L226 Difference]: Without dead ends: 246 [2018-11-10 10:30:47,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:30:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-10 10:30:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 188. [2018-11-10 10:30:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 10:30:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 232 transitions. [2018-11-10 10:30:47,264 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 232 transitions. Word has length 24 [2018-11-10 10:30:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,264 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 232 transitions. [2018-11-10 10:30:47,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:30:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2018-11-10 10:30:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:30:47,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,265 INFO L375 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] [2018-11-10 10:30:47,267 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 402424037, now seen corresponding path program 1 times [2018-11-10 10:30:47,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,268 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:47,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:47,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:47,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:47,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:47,288 INFO L87 Difference]: Start difference. First operand 188 states and 232 transitions. Second operand 3 states. [2018-11-10 10:30:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,295 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2018-11-10 10:30:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:47,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 10:30:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,297 INFO L225 Difference]: With dead ends: 190 [2018-11-10 10:30:47,297 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 10:30:47,297 INFO L605 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-11-10 10:30:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 10:30:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-10 10:30:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 10:30:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 234 transitions. [2018-11-10 10:30:47,300 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 234 transitions. Word has length 24 [2018-11-10 10:30:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,300 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 234 transitions. [2018-11-10 10:30:47,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2018-11-10 10:30:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:30:47,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,301 INFO L375 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, 1] [2018-11-10 10:30:47,302 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 176661409, now seen corresponding path program 1 times [2018-11-10 10:30:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:47,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:47,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:30:47,337 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:47,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:30:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:30:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:47,338 INFO L87 Difference]: Start difference. First operand 190 states and 234 transitions. Second operand 5 states. [2018-11-10 10:30:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,456 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2018-11-10 10:30:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:30:47,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 10:30:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,457 INFO L225 Difference]: With dead ends: 184 [2018-11-10 10:30:47,457 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 10:30:47,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:30:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 10:30:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-10 10:30:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 10:30:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2018-11-10 10:30:47,461 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 26 [2018-11-10 10:30:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,461 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2018-11-10 10:30:47,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:30:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2018-11-10 10:30:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:30:47,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,462 INFO L375 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, 1] [2018-11-10 10:30:47,462 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 182972007, now seen corresponding path program 1 times [2018-11-10 10:30:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:47,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:47,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:30:47,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:47,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:30:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:30:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:30:47,503 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand 6 states. [2018-11-10 10:30:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,591 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2018-11-10 10:30:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:30:47,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-10 10:30:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,593 INFO L225 Difference]: With dead ends: 180 [2018-11-10 10:30:47,593 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 10:30:47,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:30:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 10:30:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-11-10 10:30:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 10:30:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 217 transitions. [2018-11-10 10:30:47,596 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 217 transitions. Word has length 26 [2018-11-10 10:30:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,596 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 217 transitions. [2018-11-10 10:30:47,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:30:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 217 transitions. [2018-11-10 10:30:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:30:47,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,597 INFO L375 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, 1, 1] [2018-11-10 10:30:47,597 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1181536563, now seen corresponding path program 1 times [2018-11-10 10:30:47,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:47,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:47,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:30:47,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:47,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:30:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:30:47,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:30:47,675 INFO L87 Difference]: Start difference. First operand 180 states and 217 transitions. Second operand 8 states. [2018-11-10 10:30:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,825 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2018-11-10 10:30:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:30:47,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-10 10:30:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,827 INFO L225 Difference]: With dead ends: 189 [2018-11-10 10:30:47,827 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 10:30:47,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:30:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 10:30:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 150. [2018-11-10 10:30:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-10 10:30:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-11-10 10:30:47,831 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 27 [2018-11-10 10:30:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,831 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-11-10 10:30:47,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:30:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-11-10 10:30:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:30:47,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,832 INFO L375 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, 1, 1] [2018-11-10 10:30:47,832 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1377165122, now seen corresponding path program 1 times [2018-11-10 10:30:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:30:47,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:47,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:30:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:30:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:30:47,877 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 5 states. [2018-11-10 10:30:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:47,973 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2018-11-10 10:30:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:30:47,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 10:30:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:47,974 INFO L225 Difference]: With dead ends: 148 [2018-11-10 10:30:47,975 INFO L226 Difference]: Without dead ends: 148 [2018-11-10 10:30:47,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:30:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-10 10:30:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-10 10:30:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 10:30:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-11-10 10:30:47,977 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 27 [2018-11-10 10:30:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:47,977 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-11-10 10:30:47,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:30:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-11-10 10:30:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:30:47,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:47,978 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:30:47,979 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:47,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1585276725, now seen corresponding path program 1 times [2018-11-10 10:30:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:47,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:48,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:48,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:30:48,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:48,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:30:48,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:30:48,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:30:48,039 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 8 states. [2018-11-10 10:30:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:48,163 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-11-10 10:30:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:30:48,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-10 10:30:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:48,164 INFO L225 Difference]: With dead ends: 156 [2018-11-10 10:30:48,164 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 10:30:48,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:30:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 10:30:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2018-11-10 10:30:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 10:30:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-11-10 10:30:48,168 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-11-10 10:30:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:48,168 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-11-10 10:30:48,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:30:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-11-10 10:30:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:30:48,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:48,169 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:30:48,170 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 605761572, now seen corresponding path program 1 times [2018-11-10 10:30:48,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:48,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:48,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:30:48,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:48,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:30:48,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:30:48,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:30:48,225 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 6 states. [2018-11-10 10:30:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:48,325 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-11-10 10:30:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:30:48,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-10 10:30:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:48,327 INFO L225 Difference]: With dead ends: 150 [2018-11-10 10:30:48,327 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 10:30:48,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:30:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 10:30:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-11-10 10:30:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 10:30:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-11-10 10:30:48,331 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 29 [2018-11-10 10:30:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:48,331 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-11-10 10:30:48,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:30:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-11-10 10:30:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:30:48,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:48,335 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:48,335 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:48,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:48,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1209380723, now seen corresponding path program 1 times [2018-11-10 10:30:48,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:48,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:48,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:30:48,457 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:48,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:30:48,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:30:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:30:48,458 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 12 states. [2018-11-10 10:30:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:48,712 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-11-10 10:30:48,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:30:48,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-10 10:30:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:48,713 INFO L225 Difference]: With dead ends: 163 [2018-11-10 10:30:48,713 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 10:30:48,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:30:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 10:30:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2018-11-10 10:30:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 10:30:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-11-10 10:30:48,717 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 32 [2018-11-10 10:30:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:48,717 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-11-10 10:30:48,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:30:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-11-10 10:30:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:30:48,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:48,718 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:48,718 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:48,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash -394987703, now seen corresponding path program 1 times [2018-11-10 10:30:48,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:48,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:48,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:48,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:30:48,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:48,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:30:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:30:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:30:48,913 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 13 states. [2018-11-10 10:30:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:49,189 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-11-10 10:30:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:30:49,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-10 10:30:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:49,190 INFO L225 Difference]: With dead ends: 159 [2018-11-10 10:30:49,190 INFO L226 Difference]: Without dead ends: 159 [2018-11-10 10:30:49,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:30:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-10 10:30:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-11-10 10:30:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-10 10:30:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-11-10 10:30:49,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 34 [2018-11-10 10:30:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:49,194 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-11-10 10:30:49,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:30:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-11-10 10:30:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:30:49,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:49,195 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:49,195 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 226936518, now seen corresponding path program 1 times [2018-11-10 10:30:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:49,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:49,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:30:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:30:49,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:30:49,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:30:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:30:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:30:49,240 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 3 states. [2018-11-10 10:30:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:49,261 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-11-10 10:30:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:30:49,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 10:30:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:49,263 INFO L225 Difference]: With dead ends: 172 [2018-11-10 10:30:49,263 INFO L226 Difference]: Without dead ends: 172 [2018-11-10 10:30:49,263 INFO L605 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-11-10 10:30:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-10 10:30:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 161. [2018-11-10 10:30:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 10:30:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2018-11-10 10:30:49,266 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 42 [2018-11-10 10:30:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:49,266 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2018-11-10 10:30:49,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:30:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2018-11-10 10:30:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:30:49,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:49,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:49,271 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:49,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 577923455, now seen corresponding path program 1 times [2018-11-10 10:30:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:49,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:49,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:49,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:30:49,419 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 10:30:49,420 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [19], [21], [25], [28], [31], [37], [41], [46], [125], [127], [129], [130], [131], [133], [136], [138], [140], [146], [148], [150], [152], [154], [156], [158], [160], [162], [188], [189], [190], [191], [193], [194], [195] [2018-11-10 10:30:49,456 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:30:49,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:30:50,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:30:50,280 INFO L272 AbstractInterpreter]: Visited 42 different actions 61 times. Never merged. Never widened. Never found a fixpoint. Largest state had 54 variables. [2018-11-10 10:30:50,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:50,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:30:50,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:50,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:30:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:50,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:30:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:50,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:30:50,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:30:50,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:50,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:50,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:30:50,463 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_#res.base| Int)) (and (= 0 (select |c_old(#valid)| |append_#Ultimate.alloc_#res.base|)) (= (store |c_old(#valid)| |append_#Ultimate.alloc_#res.base| 1) |c_#valid|))) is different from true [2018-11-10 10:30:50,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:50,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:50,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:30:50,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:50,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:50,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-10 10:30:50,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-10 10:30:50,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:50,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:50,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-11-10 10:30:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-10 10:30:50,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:30:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:30:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-11-10 10:30:50,787 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:30:50,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:30:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:30:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2018-11-10 10:30:50,788 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 17 states. [2018-11-10 10:30:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:51,605 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2018-11-10 10:30:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:30:51,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-11-10 10:30:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:51,607 INFO L225 Difference]: With dead ends: 195 [2018-11-10 10:30:51,608 INFO L226 Difference]: Without dead ends: 195 [2018-11-10 10:30:51,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=4, NotChecked=52, Total=812 [2018-11-10 10:30:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-10 10:30:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2018-11-10 10:30:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 10:30:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-11-10 10:30:51,613 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 45 [2018-11-10 10:30:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:51,614 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-11-10 10:30:51,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:30:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-11-10 10:30:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 10:30:51,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:51,614 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:51,615 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:51,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 735758084, now seen corresponding path program 1 times [2018-11-10 10:30:51,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:51,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:51,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:51,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:51,764 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:30:51,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 10:30:51,764 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [19], [21], [25], [28], [31], [37], [41], [46], [125], [127], [129], [131], [132], [133], [136], [138], [140], [146], [148], [150], [152], [154], [156], [158], [160], [162], [188], [189], [190], [191], [193], [194], [195] [2018-11-10 10:30:51,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:30:51,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:30:52,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:30:52,434 INFO L272 AbstractInterpreter]: Visited 42 different actions 61 times. Never merged. Never widened. Never found a fixpoint. Largest state had 54 variables. [2018-11-10 10:30:52,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:52,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:30:52,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:52,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:30:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:52,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:30:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:52,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:30:52,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:30:52,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:30:52,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-11-10 10:30:52,535 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| Int) (|append_#Ultimate.alloc_#res.base| Int)) (and (= 0 (select |c_old(#valid)| |append_#Ultimate.alloc_#res.base|)) (= (store |c_old(#valid)| |append_#Ultimate.alloc_#res.base| 1) |c_#valid|) (= (store |c_old(#length)| |append_#Ultimate.alloc_#res.base| |append_#Ultimate.alloc_~size|) |c_#length|))) is different from true [2018-11-10 10:30:52,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,556 INFO L477 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-11-10 10:30:52,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:30:52,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:52,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-11-10 10:30:52,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:52,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:30:52,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:30:52,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:52,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:9 [2018-11-10 10:30:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-10 10:30:52,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:30:52,856 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 10:30:52,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 48 [2018-11-10 10:30:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:30:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-11-10 10:30:55,301 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:30:55,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:30:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:30:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=396, Unknown=2, NotChecked=40, Total=506 [2018-11-10 10:30:55,302 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 16 states. [2018-11-10 10:30:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:56,455 INFO L93 Difference]: Finished difference Result 346 states and 369 transitions. [2018-11-10 10:30:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 10:30:56,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-11-10 10:30:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:56,456 INFO L225 Difference]: With dead ends: 346 [2018-11-10 10:30:56,456 INFO L226 Difference]: Without dead ends: 346 [2018-11-10 10:30:56,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=193, Invalid=926, Unknown=7, NotChecked=64, Total=1190 [2018-11-10 10:30:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-10 10:30:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 270. [2018-11-10 10:30:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-10 10:30:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 323 transitions. [2018-11-10 10:30:56,462 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 323 transitions. Word has length 46 [2018-11-10 10:30:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:56,463 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 323 transitions. [2018-11-10 10:30:56,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 10:30:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 323 transitions. [2018-11-10 10:30:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 10:30:56,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:56,463 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:56,464 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:30:56,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1751133860, now seen corresponding path program 1 times [2018-11-10 10:30:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:56,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:56,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:30:56,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-10 10:30:56,660 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [19], [21], [25], [28], [31], [37], [41], [46], [125], [127], [129], [131], [133], [136], [138], [139], [140], [146], [148], [150], [152], [154], [156], [158], [160], [162], [188], [189], [190], [191], [193], [194], [195] [2018-11-10 10:30:56,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:30:56,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:30:57,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:30:57,320 INFO L272 AbstractInterpreter]: Visited 42 different actions 61 times. Never merged. Never widened. Never found a fixpoint. Largest state had 54 variables. [2018-11-10 10:30:57,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:57,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:30:57,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:57,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:30:57,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:57,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:30:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:57,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:30:57,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:30:57,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:30:57,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-11-10 10:30:57,392 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| Int) (|append_#Ultimate.alloc_#res.base| Int)) (and (= 0 (select |c_old(#valid)| |append_#Ultimate.alloc_#res.base|)) (= (store |c_old(#valid)| |append_#Ultimate.alloc_#res.base| 1) |c_#valid|) (= (store |c_old(#length)| |append_#Ultimate.alloc_#res.base| |append_#Ultimate.alloc_~size|) |c_#length|))) is different from true [2018-11-10 10:30:57,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,403 INFO L477 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-11-10 10:30:57,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:30:57,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:57,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-11-10 10:30:57,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:57,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:30:57,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-10 10:30:57,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:57,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:9 [2018-11-10 10:30:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-10 10:30:57,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:30:59,629 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 10:30:59,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-10 10:30:59,721 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2018-11-10 10:31:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:31:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2018-11-10 10:31:00,340 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:31:00,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:31:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:31:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=437, Unknown=1, NotChecked=42, Total=552 [2018-11-10 10:31:00,341 INFO L87 Difference]: Start difference. First operand 270 states and 323 transitions. Second operand 17 states. [2018-11-10 10:31:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:01,949 INFO L93 Difference]: Finished difference Result 340 states and 363 transitions. [2018-11-10 10:31:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:31:01,950 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-11-10 10:31:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:01,951 INFO L225 Difference]: With dead ends: 340 [2018-11-10 10:31:01,951 INFO L226 Difference]: Without dead ends: 340 [2018-11-10 10:31:01,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=231, Invalid=1098, Unknown=7, NotChecked=70, Total=1406 [2018-11-10 10:31:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-10 10:31:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 270. [2018-11-10 10:31:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-10 10:31:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 317 transitions. [2018-11-10 10:31:01,957 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 317 transitions. Word has length 49 [2018-11-10 10:31:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:01,957 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 317 transitions. [2018-11-10 10:31:01,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:31:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 317 transitions. [2018-11-10 10:31:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 10:31:01,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:01,958 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:01,958 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:01,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1356220878, now seen corresponding path program 1 times [2018-11-10 10:31:01,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:31:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:01,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:31:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:02,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:02,065 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:31:02,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:02,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:02,066 INFO L87 Difference]: Start difference. First operand 270 states and 317 transitions. Second operand 8 states. [2018-11-10 10:31:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:02,197 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2018-11-10 10:31:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:31:02,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-10 10:31:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:02,198 INFO L225 Difference]: With dead ends: 277 [2018-11-10 10:31:02,198 INFO L226 Difference]: Without dead ends: 277 [2018-11-10 10:31:02,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:31:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-10 10:31:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 241. [2018-11-10 10:31:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 10:31:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 268 transitions. [2018-11-10 10:31:02,203 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 268 transitions. Word has length 52 [2018-11-10 10:31:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:02,205 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 268 transitions. [2018-11-10 10:31:02,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 268 transitions. [2018-11-10 10:31:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:31:02,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:02,205 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:02,206 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1953178896, now seen corresponding path program 1 times [2018-11-10 10:31:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:31:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:02,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:31:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:02,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:02,273 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:31:02,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:02,274 INFO L87 Difference]: Start difference. First operand 241 states and 268 transitions. Second operand 8 states. [2018-11-10 10:31:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:02,446 INFO L93 Difference]: Finished difference Result 254 states and 275 transitions. [2018-11-10 10:31:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:31:02,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-10 10:31:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:02,448 INFO L225 Difference]: With dead ends: 254 [2018-11-10 10:31:02,448 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 10:31:02,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:31:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 10:31:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 239. [2018-11-10 10:31:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 10:31:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2018-11-10 10:31:02,452 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 54 [2018-11-10 10:31:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:02,453 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2018-11-10 10:31:02,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2018-11-10 10:31:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 10:31:02,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:02,453 INFO L375 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, 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-11-10 10:31:02,454 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:02,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1093930211, now seen corresponding path program 1 times [2018-11-10 10:31:02,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:31:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:02,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:02,455 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:31:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:02,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:31:02,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:31:02,913 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 10:31:02,913 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [13], [15], [17], [19], [21], [25], [28], [33], [125], [127], [129], [131], [133], [136], [138], [140], [142], [146], [148], [150], [152], [154], [156], [158], [160], [162], [163], [165], [167], [169], [171], [173], [175], [177], [179], [180], [188], [189], [190], [191], [193], [194] [2018-11-10 10:31:02,915 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:31:02,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:31:03,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:31:03,277 INFO L272 AbstractInterpreter]: Visited 48 different actions 50 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 58 variables. [2018-11-10 10:31:03,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:03,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:31:03,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:31:03,283 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:31:03,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:03,289 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:31:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:03,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:03,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:03,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:03,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:31:03,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:03,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-10 10:31:03,514 INFO L477 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 13 treesize of output 10 [2018-11-10 10:31:03,515 INFO L477 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 10 treesize of output 9 [2018-11-10 10:31:03,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-10 10:31:03,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 10:31:03,560 INFO L477 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 22 treesize of output 21 [2018-11-10 10:31:03,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 10:31:03,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,598 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:47 [2018-11-10 10:31:03,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2018-11-10 10:31:03,653 INFO L477 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 53 treesize of output 52 [2018-11-10 10:31:03,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:31:03,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,726 INFO L477 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 23 treesize of output 20 [2018-11-10 10:31:03,731 INFO L477 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-11-10 10:31:03,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:03,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:76, output treesize:42 [2018-11-10 10:31:03,793 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 10:31:03,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 52 [2018-11-10 10:31:03,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:03,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:49 [2018-11-10 10:31:03,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:03,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-11-10 10:31:03,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:03,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:03,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:75 [2018-11-10 10:31:04,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-11-10 10:31:04,139 INFO L477 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-11-10 10:31:04,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:04,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:78 [2018-11-10 10:31:04,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-11-10 10:31:04,221 INFO L477 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-11-10 10:31:04,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:04,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:91, output treesize:80 [2018-11-10 10:31:04,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 39 [2018-11-10 10:31:04,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:04,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-11-10 10:31:04,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:04,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:04,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:45 [2018-11-10 10:31:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:04,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:31:08,413 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 10:31:08,733 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 62 [2018-11-10 10:31:08,752 INFO L477 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-11-10 10:31:08,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:08,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:08,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:08,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 74 [2018-11-10 10:31:08,905 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2018-11-10 10:31:08,907 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-10 10:31:08,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-10 10:31:08,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:08,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:08,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 42 treesize of output 52 [2018-11-10 10:31:08,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-11-10 10:31:08,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:09,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 70 [2018-11-10 10:31:09,017 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-11-10 10:31:09,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 10:31:09,133 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 10:31:09,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,138 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,145 INFO L477 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-11-10 10:31:09,146 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:31:09,166 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 10:31:09,168 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 10:31:09,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 44 [2018-11-10 10:31:09,182 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 10:31:09,217 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 10:31:09,219 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 10:31:09,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 44 [2018-11-10 10:31:09,237 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-10 10:31:09,267 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 10:31:09,269 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-10 10:31:09,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,276 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 70 [2018-11-10 10:31:09,296 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 20 xjuncts. [2018-11-10 10:31:09,449 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 13 xjuncts. [2018-11-10 10:31:09,452 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-10 10:31:09,457 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-10 10:31:09,458 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:09,470 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:09,756 INFO L477 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 47 treesize of output 39 [2018-11-10 10:31:09,761 INFO L477 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 13 treesize of output 8 [2018-11-10 10:31:09,761 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:09,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,769 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 10:31:09,770 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:09,776 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:09,778 INFO L477 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 43 treesize of output 37 [2018-11-10 10:31:09,780 INFO L477 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 6 treesize of output 1 [2018-11-10 10:31:09,781 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:09,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:09,795 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 10:31:09,795 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:09,801 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:10,075 INFO L477 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 42 treesize of output 42 [2018-11-10 10:31:10,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:10,081 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:10,294 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:31:10,295 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_66 term size 41 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 10:31:10,297 INFO L168 Benchmark]: Toolchain (without parser) took 26860.21 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 786.4 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -97.8 MB). Peak memory consumption was 688.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,298 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:31:10,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.4 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.4 MB in the beginning and 1.1 GB in the end (delta: -213.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,299 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,299 INFO L168 Benchmark]: RCFGBuilder took 465.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,299 INFO L168 Benchmark]: TraceAbstraction took 25978.61 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 637.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 668.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:10,300 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.4 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 929.4 MB in the beginning and 1.1 GB in the end (delta: -213.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25978.61 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 637.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 668.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_66 term size 41 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_66 term size 41: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:31:11,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:31:11,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:31:11,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:31:11,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:31:11,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:31:11,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:31:11,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:31:11,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:31:11,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:31:11,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:31:11,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:31:11,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:31:11,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:31:11,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:31:11,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:31:11,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:31:11,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:31:11,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:31:11,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:31:11,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:31:11,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:31:11,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:31:11,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:31:11,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:31:11,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:31:11,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:31:11,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:31:11,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:31:11,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:31:11,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:31:11,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:31:11,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:31:11,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:31:11,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:31:11,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:31:11,805 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-10 10:31:11,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:31:11,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:31:11,816 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:31:11,816 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:31:11,816 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:31:11,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:31:11,816 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:31:11,817 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:31:11,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:31:11,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:31:11,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:31:11,818 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:31:11,818 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:31:11,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:31:11,818 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:31:11,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:31:11,819 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 10:31:11,819 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 10:31:11,820 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 10:31:11,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:31:11,820 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:31:11,820 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:31:11,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:31:11,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:31:11,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:31:11,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:31:11,822 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:31:11,822 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-11-10 10:31:11,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:31:11,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:31:11,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:31:11,869 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:31:11,869 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:31:11,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-10 10:31:11,911 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/961362050/264eabef8e1d4164895109541da2bf66/FLAG197ae4f77 [2018-11-10 10:31:12,265 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:31:12,266 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-10 10:31:12,274 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/961362050/264eabef8e1d4164895109541da2bf66/FLAG197ae4f77 [2018-11-10 10:31:12,282 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/data/961362050/264eabef8e1d4164895109541da2bf66 [2018-11-10 10:31:12,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:31:12,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:31:12,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:31:12,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:31:12,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:31:12,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bdf600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12, skipping insertion in model container [2018-11-10 10:31:12,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:31:12,329 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:31:12,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:31:12,560 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:31:12,598 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:31:12,637 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:31:12,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12 WrapperNode [2018-11-10 10:31:12,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:31:12,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:31:12,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:31:12,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:31:12,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:31:12,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:31:12,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:31:12,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:31:12,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... [2018-11-10 10:31:12,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:31:12,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:31:12,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:31:12,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:31:12,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/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-11-10 10:31:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:31:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:31:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:31:12,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:31:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:31:12,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:31:12,780 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-10 10:31:12,780 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-10 10:31:13,397 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:31:13,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:31:13 BoogieIcfgContainer [2018-11-10 10:31:13,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:31:13,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:31:13,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:31:13,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:31:13,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:31:12" (1/3) ... [2018-11-10 10:31:13,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235ce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:31:13, skipping insertion in model container [2018-11-10 10:31:13,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:12" (2/3) ... [2018-11-10 10:31:13,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235ce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:31:13, skipping insertion in model container [2018-11-10 10:31:13,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:31:13" (3/3) ... [2018-11-10 10:31:13,403 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-11-10 10:31:13,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:31:13,419 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-10 10:31:13,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-10 10:31:13,453 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:31:13,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:31:13,453 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 10:31:13,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:31:13,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:31:13,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:31:13,454 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:31:13,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:31:13,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:31:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-11-10 10:31:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 10:31:13,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:13,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:13,480 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:13,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1096514590, now seen corresponding path program 1 times [2018-11-10 10:31:13,487 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:13,487 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:13,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:13,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:13,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:13,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:13,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:13,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:31:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:13,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:13,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:13,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:31:13,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:13,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:13,605 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-11-10 10:31:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:13,882 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-11-10 10:31:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:13,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-10 10:31:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:13,892 INFO L225 Difference]: With dead ends: 140 [2018-11-10 10:31:13,892 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 10:31:13,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-10 10:31:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 10:31:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-10 10:31:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 10:31:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-11-10 10:31:13,928 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 7 [2018-11-10 10:31:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:13,928 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-11-10 10:31:13,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-11-10 10:31:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 10:31:13,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:13,929 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:13,930 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:13,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash -367786039, now seen corresponding path program 1 times [2018-11-10 10:31:13,930 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:13,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:13,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:13,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:13,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:13,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:13,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:31:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:14,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:31:14,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:14,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:14,010 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 3 states. [2018-11-10 10:31:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:14,256 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-11-10 10:31:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:14,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 10:31:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:14,258 INFO L225 Difference]: With dead ends: 133 [2018-11-10 10:31:14,258 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 10:31:14,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-10 10:31:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 10:31:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 10:31:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 10:31:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-11-10 10:31:14,267 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 8 [2018-11-10 10:31:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:14,267 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-11-10 10:31:14,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-11-10 10:31:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 10:31:14,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:14,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:14,269 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:14,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1483534720, now seen corresponding path program 1 times [2018-11-10 10:31:14,270 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:14,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:14,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:14,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:14,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:14,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:14,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:14,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:31:14,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:31:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:31:14,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:14,330 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 5 states. [2018-11-10 10:31:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:14,646 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-11-10 10:31:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:31:14,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 10:31:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:14,647 INFO L225 Difference]: With dead ends: 134 [2018-11-10 10:31:14,647 INFO L226 Difference]: Without dead ends: 134 [2018-11-10 10:31:14,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:31:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-10 10:31:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-11-10 10:31:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 10:31:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-11-10 10:31:14,652 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 9 [2018-11-10 10:31:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:14,652 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-11-10 10:31:14,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:31:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-11-10 10:31:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 10:31:14,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:14,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:14,654 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:14,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1255063893, now seen corresponding path program 1 times [2018-11-10 10:31:14,654 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:14,654 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:14,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:14,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:14,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:14,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:14,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:14,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:14,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:14,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:14,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:14,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:14,736 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-11-10 10:31:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:15,066 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-11-10 10:31:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:15,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-10 10:31:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:15,068 INFO L225 Difference]: With dead ends: 133 [2018-11-10 10:31:15,068 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 10:31:15,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 10:31:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-10 10:31:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 10:31:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2018-11-10 10:31:15,075 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 10 [2018-11-10 10:31:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:15,075 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2018-11-10 10:31:15,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2018-11-10 10:31:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 10:31:15,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:15,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:15,077 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:15,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1918079932, now seen corresponding path program 1 times [2018-11-10 10:31:15,077 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:15,078 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:15,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:15,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:15,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:31:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:15,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:15,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:15,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:15,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:15,151 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 4 states. [2018-11-10 10:31:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:15,436 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-11-10 10:31:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:15,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 10:31:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:15,438 INFO L225 Difference]: With dead ends: 132 [2018-11-10 10:31:15,438 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 10:31:15,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 10:31:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-10 10:31:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 10:31:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-11-10 10:31:15,444 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 13 [2018-11-10 10:31:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:15,444 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-11-10 10:31:15,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-10 10:31:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:31:15,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:15,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:15,445 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:15,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 669064303, now seen corresponding path program 1 times [2018-11-10 10:31:15,446 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:15,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:15,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:15,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:15,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:15,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:15,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:15,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:15,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:15,541 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 4 states. [2018-11-10 10:31:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:15,846 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-11-10 10:31:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:15,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-10 10:31:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:15,847 INFO L225 Difference]: With dead ends: 131 [2018-11-10 10:31:15,847 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 10:31:15,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 10:31:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-10 10:31:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 10:31:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-11-10 10:31:15,852 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 14 [2018-11-10 10:31:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:15,853 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-11-10 10:31:15,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-11-10 10:31:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 10:31:15,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:15,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:15,854 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:15,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash -534011400, now seen corresponding path program 1 times [2018-11-10 10:31:15,855 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:15,855 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:15,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:15,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:15,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:15,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:15,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:31:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:15,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:15,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:31:15,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:15,965 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 3 states. [2018-11-10 10:31:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:16,168 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-10 10:31:16,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:16,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 10:31:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:16,169 INFO L225 Difference]: With dead ends: 128 [2018-11-10 10:31:16,169 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 10:31:16,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11-10 10:31:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 10:31:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-11-10 10:31:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 10:31:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-11-10 10:31:16,173 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 18 [2018-11-10 10:31:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:16,173 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-11-10 10:31:16,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-10 10:31:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 10:31:16,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:16,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:16,175 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:16,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash 625515942, now seen corresponding path program 1 times [2018-11-10 10:31:16,175 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:16,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:16,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:16,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:16,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:31:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:16,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:16,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:16,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:31:16,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:16,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:16,267 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 3 states. [2018-11-10 10:31:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:16,479 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-11-10 10:31:16,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:16,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 10:31:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:16,480 INFO L225 Difference]: With dead ends: 127 [2018-11-10 10:31:16,480 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 10:31:16,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-11-10 10:31:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 10:31:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-10 10:31:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 10:31:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-11-10 10:31:16,484 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 19 [2018-11-10 10:31:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:16,484 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-11-10 10:31:16,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-11-10 10:31:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:31:16,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:16,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:16,485 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:16,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2083842118, now seen corresponding path program 1 times [2018-11-10 10:31:16,485 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:16,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:16,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:16,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:16,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:16,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:16,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:16,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:31:16,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:16,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-10 10:31:16,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 10:31:16,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:16,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:16,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-11-10 10:31:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:16,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:16,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:16,711 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2018-11-10 10:31:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:17,610 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-11-10 10:31:17,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:31:17,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-10 10:31:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:17,611 INFO L225 Difference]: With dead ends: 224 [2018-11-10 10:31:17,611 INFO L226 Difference]: Without dead ends: 224 [2018-11-10 10:31:17,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:31:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-10 10:31:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 158. [2018-11-10 10:31:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-10 10:31:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-11-10 10:31:17,615 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 20 [2018-11-10 10:31:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:17,616 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-11-10 10:31:17,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-11-10 10:31:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 10:31:17,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:17,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:17,617 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:17,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash -174596056, now seen corresponding path program 1 times [2018-11-10 10:31:17,617 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:17,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:17,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:17,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:17,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 10:31:17,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:17,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:17,756 INFO L477 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 11 treesize of output 4 [2018-11-10 10:31:17,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,766 INFO L477 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-11-10 10:31:17,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:17,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-11-10 10:31:17,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:17,797 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:31:17,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:17,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:17,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:31:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:17,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:17,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:17,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:31:17,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:31:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:31:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:31:17,852 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 7 states. [2018-11-10 10:31:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:18,843 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2018-11-10 10:31:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:31:18,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-10 10:31:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:18,845 INFO L225 Difference]: With dead ends: 229 [2018-11-10 10:31:18,845 INFO L226 Difference]: Without dead ends: 229 [2018-11-10 10:31:18,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-10 10:31:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 191. [2018-11-10 10:31:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 10:31:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2018-11-10 10:31:18,850 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 21 [2018-11-10 10:31:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:18,850 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2018-11-10 10:31:18,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:31:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2018-11-10 10:31:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:31:18,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:18,851 INFO L375 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] [2018-11-10 10:31:18,852 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:18,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -185544929, now seen corresponding path program 1 times [2018-11-10 10:31:18,852 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:18,852 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:18,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:19,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:19,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:19,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 10:31:19,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:19,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:19,042 INFO L477 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 11 treesize of output 4 [2018-11-10 10:31:19,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,060 INFO L477 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-11-10 10:31:19,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:19,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-11-10 10:31:19,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:19,128 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:31:19,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:19,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:19,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:31:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:19,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:19,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:19,276 INFO L87 Difference]: Start difference. First operand 191 states and 239 transitions. Second operand 8 states. [2018-11-10 10:31:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:20,380 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2018-11-10 10:31:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:31:20,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-10 10:31:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:20,382 INFO L225 Difference]: With dead ends: 226 [2018-11-10 10:31:20,382 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 10:31:20,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:31:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 10:31:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2018-11-10 10:31:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 10:31:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 236 transitions. [2018-11-10 10:31:20,387 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 236 transitions. Word has length 24 [2018-11-10 10:31:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:20,387 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 236 transitions. [2018-11-10 10:31:20,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 236 transitions. [2018-11-10 10:31:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 10:31:20,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:20,388 INFO L375 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] [2018-11-10 10:31:20,389 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:20,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash -185538907, now seen corresponding path program 1 times [2018-11-10 10:31:20,390 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:20,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:20,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:20,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:20,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:20,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:20,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:20,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:20,450 INFO L87 Difference]: Start difference. First operand 191 states and 236 transitions. Second operand 3 states. [2018-11-10 10:31:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:20,464 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2018-11-10 10:31:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:20,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 10:31:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:20,466 INFO L225 Difference]: With dead ends: 194 [2018-11-10 10:31:20,466 INFO L226 Difference]: Without dead ends: 194 [2018-11-10 10:31:20,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-11-10 10:31:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-10 10:31:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-11-10 10:31:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-10 10:31:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-11-10 10:31:20,471 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 24 [2018-11-10 10:31:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:20,472 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-11-10 10:31:20,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-11-10 10:31:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:31:20,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:20,472 INFO L375 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, 1] [2018-11-10 10:31:20,473 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:20,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2079955265, now seen corresponding path program 1 times [2018-11-10 10:31:20,474 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:20,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:20,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:20,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:20,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:31:20,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:31:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:31:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:20,607 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 5 states. [2018-11-10 10:31:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:20,890 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2018-11-10 10:31:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:31:20,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 10:31:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:20,891 INFO L225 Difference]: With dead ends: 188 [2018-11-10 10:31:20,891 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 10:31:20,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:31:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 10:31:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-11-10 10:31:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-10 10:31:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2018-11-10 10:31:20,894 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 26 [2018-11-10 10:31:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:20,895 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2018-11-10 10:31:20,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:31:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2018-11-10 10:31:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:31:20,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:20,896 INFO L375 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, 1] [2018-11-10 10:31:20,897 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:20,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2086265863, now seen corresponding path program 1 times [2018-11-10 10:31:20,897 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:20,897 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:20,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:21,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:21,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:21,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:21,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:31:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:21,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:21,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:21,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:21,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:21,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:21,012 INFO L87 Difference]: Start difference. First operand 188 states and 227 transitions. Second operand 4 states. [2018-11-10 10:31:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:21,285 INFO L93 Difference]: Finished difference Result 184 states and 215 transitions. [2018-11-10 10:31:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:21,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-10 10:31:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:21,286 INFO L225 Difference]: With dead ends: 184 [2018-11-10 10:31:21,286 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 10:31:21,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 10:31:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-10 10:31:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 10:31:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 215 transitions. [2018-11-10 10:31:21,290 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 215 transitions. Word has length 26 [2018-11-10 10:31:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:21,290 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 215 transitions. [2018-11-10 10:31:21,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 215 transitions. [2018-11-10 10:31:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:31:21,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:21,291 INFO L375 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, 1, 1] [2018-11-10 10:31:21,292 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:21,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 54103954, now seen corresponding path program 1 times [2018-11-10 10:31:21,292 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:21,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:21,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:21,494 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:21,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:21,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:21,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:21,496 INFO L87 Difference]: Start difference. First operand 184 states and 215 transitions. Second operand 8 states. [2018-11-10 10:31:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:22,022 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-11-10 10:31:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:31:22,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-10 10:31:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:22,023 INFO L225 Difference]: With dead ends: 198 [2018-11-10 10:31:22,023 INFO L226 Difference]: Without dead ends: 198 [2018-11-10 10:31:22,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:31:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-10 10:31:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2018-11-10 10:31:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 10:31:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2018-11-10 10:31:22,027 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 27 [2018-11-10 10:31:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:22,027 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2018-11-10 10:31:22,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2018-11-10 10:31:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:31:22,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:22,028 INFO L375 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, 1, 1] [2018-11-10 10:31:22,028 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:22,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:22,028 INFO L82 PathProgramCache]: Analyzing trace with hash 249732513, now seen corresponding path program 1 times [2018-11-10 10:31:22,028 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:22,029 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:22,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:22,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:22,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:22,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:22,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:22,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:22,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:22,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:22,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:22,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:22,163 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand 4 states. [2018-11-10 10:31:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:22,463 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2018-11-10 10:31:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:22,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-10 10:31:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:22,464 INFO L225 Difference]: With dead ends: 183 [2018-11-10 10:31:22,464 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 10:31:22,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 10:31:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-10 10:31:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 10:31:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 207 transitions. [2018-11-10 10:31:22,468 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 207 transitions. Word has length 27 [2018-11-10 10:31:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:22,468 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 207 transitions. [2018-11-10 10:31:22,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2018-11-10 10:31:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:31:22,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:22,469 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:31:22,469 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:22,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 454298036, now seen corresponding path program 1 times [2018-11-10 10:31:22,470 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:22,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:22,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:31:22,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:22,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:22,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:22,640 INFO L87 Difference]: Start difference. First operand 183 states and 207 transitions. Second operand 8 states. [2018-11-10 10:31:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:23,111 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2018-11-10 10:31:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:31:23,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-10 10:31:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:23,113 INFO L225 Difference]: With dead ends: 196 [2018-11-10 10:31:23,113 INFO L226 Difference]: Without dead ends: 196 [2018-11-10 10:31:23,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:31:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-10 10:31:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2018-11-10 10:31:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 10:31:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 203 transitions. [2018-11-10 10:31:23,117 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 203 transitions. Word has length 29 [2018-11-10 10:31:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:23,117 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 203 transitions. [2018-11-10 10:31:23,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:31:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 203 transitions. [2018-11-10 10:31:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:31:23,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:23,118 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:31:23,118 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:23,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash -525217117, now seen corresponding path program 1 times [2018-11-10 10:31:23,119 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:23,119 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:23,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:23,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:23,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:23,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:23,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:23,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:23,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:23,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:23,300 INFO L87 Difference]: Start difference. First operand 183 states and 203 transitions. Second operand 4 states. [2018-11-10 10:31:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:23,595 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2018-11-10 10:31:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:23,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 10:31:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:23,596 INFO L225 Difference]: With dead ends: 187 [2018-11-10 10:31:23,596 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 10:31:23,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:31:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 10:31:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2018-11-10 10:31:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-10 10:31:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2018-11-10 10:31:23,600 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 29 [2018-11-10 10:31:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:23,600 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2018-11-10 10:31:23,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2018-11-10 10:31:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:31:23,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:23,601 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:23,601 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:23,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash -177068595, now seen corresponding path program 1 times [2018-11-10 10:31:23,602 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:23,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:23,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:23,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:23,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:23,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-11-10 10:31:23,855 INFO L477 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 11 treesize of output 8 [2018-11-10 10:31:23,858 INFO L477 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-11-10 10:31:23,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,873 INFO L477 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 11 treesize of output 8 [2018-11-10 10:31:23,875 INFO L477 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-11-10 10:31:23,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-10 10:31:23,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:23,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:23,922 INFO L477 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 11 treesize of output 4 [2018-11-10 10:31:23,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,973 INFO L477 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 21 treesize of output 16 [2018-11-10 10:31:23,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:23,980 INFO L477 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 16 treesize of output 23 [2018-11-10 10:31:23,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:23,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,014 INFO L477 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 21 treesize of output 16 [2018-11-10 10:31:24,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:24,020 INFO L477 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 16 treesize of output 23 [2018-11-10 10:31:24,020 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,042 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:57, output treesize:25 [2018-11-10 10:31:24,067 INFO L477 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 19 treesize of output 20 [2018-11-10 10:31:24,070 INFO L477 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-11-10 10:31:24,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,097 INFO L477 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 19 treesize of output 20 [2018-11-10 10:31:24,100 INFO L477 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-11-10 10:31:24,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:22 [2018-11-10 10:31:24,143 INFO L477 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 19 treesize of output 20 [2018-11-10 10:31:24,146 INFO L477 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-11-10 10:31:24,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,176 INFO L477 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 19 treesize of output 20 [2018-11-10 10:31:24,178 INFO L477 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-11-10 10:31:24,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:44, output treesize:18 [2018-11-10 10:31:24,258 INFO L477 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 7 treesize of output 5 [2018-11-10 10:31:24,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,262 INFO L477 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 7 treesize of output 5 [2018-11-10 10:31:24,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:24,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:1 [2018-11-10 10:31:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:24,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:24,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:24,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:31:24,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:31:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:31:24,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:31:24,280 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand 11 states. [2018-11-10 10:31:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:25,285 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2018-11-10 10:31:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:31:25,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-10 10:31:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:25,286 INFO L225 Difference]: With dead ends: 180 [2018-11-10 10:31:25,286 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 10:31:25,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-10 10:31:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 10:31:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-11-10 10:31:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 10:31:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-11-10 10:31:25,290 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 32 [2018-11-10 10:31:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:25,290 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-11-10 10:31:25,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:31:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-11-10 10:31:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 10:31:25,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:25,293 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:25,293 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:25,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash -480478103, now seen corresponding path program 1 times [2018-11-10 10:31:25,293 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:25,293 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:25,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:25,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:25,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:25,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:25,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:25,539 INFO L477 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 11 treesize of output 4 [2018-11-10 10:31:25,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,560 INFO L477 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 13 treesize of output 10 [2018-11-10 10:31:25,562 INFO L477 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 10 treesize of output 9 [2018-11-10 10:31:25,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,575 INFO L477 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 13 treesize of output 10 [2018-11-10 10:31:25,577 INFO L477 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 10 treesize of output 9 [2018-11-10 10:31:25,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,587 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2018-11-10 10:31:25,623 INFO L477 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 21 treesize of output 22 [2018-11-10 10:31:25,626 INFO L477 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-11-10 10:31:25,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,657 INFO L477 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 21 treesize of output 22 [2018-11-10 10:31:25,661 INFO L477 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-11-10 10:31:25,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:26 [2018-11-10 10:31:25,719 INFO L477 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 21 treesize of output 22 [2018-11-10 10:31:25,722 INFO L477 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-11-10 10:31:25,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,755 INFO L477 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 21 treesize of output 22 [2018-11-10 10:31:25,758 INFO L477 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-11-10 10:31:25,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:25,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:48, output treesize:22 [2018-11-10 10:31:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:25,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:25,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:31:25,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:31:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:31:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:31:25,884 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 11 states. [2018-11-10 10:31:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:26,630 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-11-10 10:31:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:31:26,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-10 10:31:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:26,631 INFO L225 Difference]: With dead ends: 168 [2018-11-10 10:31:26,631 INFO L226 Difference]: Without dead ends: 168 [2018-11-10 10:31:26,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:31:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-10 10:31:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-10 10:31:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-10 10:31:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-11-10 10:31:26,635 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 34 [2018-11-10 10:31:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:26,635 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-11-10 10:31:26,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:31:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-11-10 10:31:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 10:31:26,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:26,636 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:26,637 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:26,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1152905065, now seen corresponding path program 1 times [2018-11-10 10:31:26,638 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:26,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:26,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:26,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:31:26,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:31:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:31:26,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:31:26,836 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 3 states. [2018-11-10 10:31:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:26,851 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2018-11-10 10:31:26,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:31:26,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-10 10:31:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:26,852 INFO L225 Difference]: With dead ends: 183 [2018-11-10 10:31:26,852 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 10:31:26,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-11-10 10:31:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 10:31:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-11-10 10:31:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-10 10:31:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 184 transitions. [2018-11-10 10:31:26,856 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 184 transitions. Word has length 41 [2018-11-10 10:31:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:26,856 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 184 transitions. [2018-11-10 10:31:26,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:31:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 184 transitions. [2018-11-10 10:31:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:31:26,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:26,857 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:26,857 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:31:26,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2007997801, now seen corresponding path program 1 times [2018-11-10 10:31:26,857 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:26,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:31:26,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:27,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:27,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:31:27,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:31:27,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:31:27,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:27,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-10 10:31:27,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 10:31:27,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:27,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-11-10 10:31:27,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-10 10:31:27,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:27,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 10:31:27,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:27,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:11 [2018-11-10 10:31:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:27,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:31:30,301 INFO L477 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 21 treesize of output 19 [2018-11-10 10:31:30,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:30,373 INFO L477 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 28 treesize of output 24 [2018-11-10 10:31:30,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:30,376 INFO L477 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 27 treesize of output 25 [2018-11-10 10:31:30,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:30,444 INFO L477 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 23 treesize of output 21 [2018-11-10 10:31:30,444 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:31:30,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-10 10:31:30,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:73, output treesize:86 [2018-11-10 10:31:31,744 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-10 10:31:31,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:31:31,747 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:31:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:31,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:32,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:32,509 INFO L477 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 14 treesize of output 17 [2018-11-10 10:31:32,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:32,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:32,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:32,529 INFO L477 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 13 treesize of output 4 [2018-11-10 10:31:32,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:32,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:32,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-11-10 10:31:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:32,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:31:36,894 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-10 10:31:36,994 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:36,995 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 9 variables, input treesize:98, output treesize:1 [2018-11-10 10:31:43,534 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-10 10:31:44,035 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-10 10:31:44,059 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-11-10 10:31:44,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:44,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 71 [2018-11-10 10:31:44,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 8 xjuncts. [2018-11-10 10:31:44,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 10:31:44,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 8 xjuncts. [2018-11-10 10:31:46,090 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-11-10 10:31:46,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:48,190 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2018-11-10 10:31:48,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 10:31:50,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 65 dim-0 vars, and 22 xjuncts. [2018-11-10 10:31:50,413 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:142, output treesize:1066 [2018-11-10 10:31:53,751 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 390 DAG size of output: 93 [2018-11-10 10:31:53,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:53,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:53,764 INFO L477 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 36 treesize of output 27 [2018-11-10 10:31:53,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:54,014 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,015 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-10 10:31:54,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:54,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-10 10:31:54,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:54,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,527 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-10 10:31:54,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:54,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:54,774 INFO L477 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 25 [2018-11-10 10:31:54,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:55,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:55,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:55,011 INFO L477 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 31 treesize of output 22 [2018-11-10 10:31:55,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:55,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:55,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:55,180 INFO L477 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 45 treesize of output 36 [2018-11-10 10:31:55,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:55,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 10:31:55,314 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 16 variables, input treesize:286, output treesize:138 [2018-11-10 10:31:55,703 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-10 10:31:56,086 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-11-10 10:31:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:31:56,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:31:56,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 32 [2018-11-10 10:31:56,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 10:31:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 10:31:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1001, Unknown=5, NotChecked=0, Total=1122 [2018-11-10 10:31:56,119 INFO L87 Difference]: Start difference. First operand 172 states and 184 transitions. Second operand 33 states. [2018-11-10 10:31:57,557 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 10:31:58,089 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2018-11-10 10:31:58,462 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-11-10 10:31:59,526 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2018-11-10 10:31:59,980 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 [2018-11-10 10:32:00,917 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2018-11-10 10:32:01,967 WARN L179 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2018-11-10 10:32:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:05,300 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-11-10 10:32:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 10:32:05,302 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-11-10 10:32:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:05,302 INFO L225 Difference]: With dead ends: 207 [2018-11-10 10:32:05,303 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 10:32:05,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=327, Invalid=1829, Unknown=6, NotChecked=0, Total=2162 [2018-11-10 10:32:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 10:32:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2018-11-10 10:32:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-10 10:32:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-11-10 10:32:05,306 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 43 [2018-11-10 10:32:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:05,306 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-11-10 10:32:05,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 10:32:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-11-10 10:32:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 10:32:05,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:05,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:05,307 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:32:05,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -468036069, now seen corresponding path program 1 times [2018-11-10 10:32:05,308 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:32:05,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:05,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:05,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:05,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:32:05,553 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_write~$Pointer$_#value.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_write~$Pointer$_#value.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_write~$Pointer$_#value.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:05,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-11-10 10:32:05,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:05,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-11-10 10:32:05,591 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:32:05,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 20 [2018-11-10 10:32:05,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:05,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-11-10 10:32:05,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:05,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:05,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:05,725 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:32:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:05,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:05,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:05,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 10:32:05,804 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:05,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:32:05,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:05,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-10 10:32:05,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:32:05,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-11-10 10:32:05,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:05,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:31 [2018-11-10 10:32:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-10 10:32:05,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:06,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:32:06,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-11-10 10:32:06,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:32:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:32:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=226, Unknown=4, NotChecked=62, Total=342 [2018-11-10 10:32:06,066 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 13 states. [2018-11-10 10:32:07,044 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 10:32:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:08,576 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2018-11-10 10:32:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:32:08,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-10 10:32:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:08,577 INFO L225 Difference]: With dead ends: 199 [2018-11-10 10:32:08,577 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 10:32:08,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=306, Unknown=4, NotChecked=74, Total=462 [2018-11-10 10:32:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 10:32:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 168. [2018-11-10 10:32:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-10 10:32:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2018-11-10 10:32:08,580 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 44 [2018-11-10 10:32:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:08,580 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2018-11-10 10:32:08,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:32:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2018-11-10 10:32:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:32:08,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:08,581 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:08,581 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:32:08,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1624216089, now seen corresponding path program 1 times [2018-11-10 10:32:08,582 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:32:08,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:08,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:08,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:08,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:08,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 10:32:08,862 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| (_ BitVec 32)) (|append_write~$Pointer$_#value.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_write~$Pointer$_#value.base| |append_#Ultimate.alloc_~size|)) (= (select |c_old(#valid)| |append_write~$Pointer$_#value.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:08,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:08,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:08,876 INFO L477 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 13 treesize of output 4 [2018-11-10 10:32:08,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,892 INFO L477 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-11-10 10:32:08,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:08,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-11-10 10:32:08,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:08,930 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:32:08,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:08,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:32:08,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:32:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:09,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:09,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:09,486 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:32:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:09,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:09,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:09,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:09,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-10 10:32:09,601 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| (_ BitVec 32)) (|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| |append_#Ultimate.alloc_~size|)) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:09,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:09,613 INFO L477 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-11-10 10:32:09,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:09,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:09,626 INFO L477 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 13 treesize of output 4 [2018-11-10 10:32:09,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:09,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-11-10 10:32:09,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:09,643 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:32:09,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:09,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:32:09,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:32:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-10 10:32:09,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:10,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:32:10,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-10 10:32:10,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:32:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:32:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=173, Unknown=3, NotChecked=54, Total=272 [2018-11-10 10:32:10,225 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 12 states. [2018-11-10 10:32:15,037 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-11-10 10:32:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:16,113 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-11-10 10:32:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:32:16,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-10 10:32:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:16,114 INFO L225 Difference]: With dead ends: 214 [2018-11-10 10:32:16,114 INFO L226 Difference]: Without dead ends: 214 [2018-11-10 10:32:16,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=60, Invalid=251, Unknown=3, NotChecked=66, Total=380 [2018-11-10 10:32:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-10 10:32:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2018-11-10 10:32:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-10 10:32:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2018-11-10 10:32:16,118 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 45 [2018-11-10 10:32:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:16,118 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2018-11-10 10:32:16,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:32:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2018-11-10 10:32:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 10:32:16,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:16,119 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:16,120 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:32:16,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 80213248, now seen corresponding path program 1 times [2018-11-10 10:32:16,120 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:16,120 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:32:16,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:16,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:16,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:16,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:16,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 10:32:16,438 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| (_ BitVec 32)) (|append_write~$Pointer$_#value.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_write~$Pointer$_#value.base| |append_#Ultimate.alloc_~size|)) (= (select |c_old(#valid)| |append_write~$Pointer$_#value.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:16,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:16,448 INFO L477 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-11-10 10:32:16,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:16,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:16,466 INFO L477 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 13 treesize of output 4 [2018-11-10 10:32:16,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:16,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-11-10 10:32:16,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:16,509 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:32:16,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:16,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:32:16,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:32:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:16,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:17,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:17,530 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:32:17,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:17,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:17,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:17,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:17,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-10 10:32:17,671 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#Ultimate.alloc_~size| (_ BitVec 32)) (|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| |append_#Ultimate.alloc_~size|)) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-10 10:32:17,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:17,682 INFO L477 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-11-10 10:32:17,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:17,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:17,695 INFO L477 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 13 treesize of output 4 [2018-11-10 10:32:17,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-11-10 10:32:17,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:17,712 INFO L477 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 2 case distinctions, treesize of input 14 treesize of output 15 [2018-11-10 10:32:17,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:17,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:32:17,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:24 [2018-11-10 10:32:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-10 10:32:17,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:19,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:32:19,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-10 10:32:19,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:32:19,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:32:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=426, Unknown=4, NotChecked=86, Total=600 [2018-11-10 10:32:19,518 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 13 states. [2018-11-10 10:32:20,456 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-10 10:32:20,692 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-10 10:32:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:21,902 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-11-10 10:32:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:32:21,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-11-10 10:32:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:21,904 INFO L225 Difference]: With dead ends: 212 [2018-11-10 10:32:21,904 INFO L226 Difference]: Without dead ends: 212 [2018-11-10 10:32:21,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=123, Invalid=583, Unknown=4, NotChecked=102, Total=812 [2018-11-10 10:32:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-10 10:32:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2018-11-10 10:32:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 10:32:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-11-10 10:32:21,908 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 48 [2018-11-10 10:32:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:21,909 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-11-10 10:32:21,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:32:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-11-10 10:32:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 10:32:21,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:21,909 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:21,910 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:32:21,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1631228433, now seen corresponding path program 1 times [2018-11-10 10:32:21,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:32:21,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:22,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:22,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:32:22,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:32:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:32:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:32:22,198 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-11-10 10:32:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:22,935 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2018-11-10 10:32:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:32:22,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-10 10:32:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:22,936 INFO L225 Difference]: With dead ends: 207 [2018-11-10 10:32:22,936 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 10:32:22,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:32:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 10:32:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-10 10:32:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-10 10:32:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2018-11-10 10:32:22,939 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 51 [2018-11-10 10:32:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:22,940 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2018-11-10 10:32:22,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:32:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2018-11-10 10:32:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:32:22,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:22,940 INFO L375 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, 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-11-10 10:32:22,941 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:32:22,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1950672898, now seen corresponding path program 1 times [2018-11-10 10:32:22,941 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:32:22,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:23,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:23,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:32:23,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 10:32:23,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:23,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:23,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:32:23,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-11-10 10:32:23,466 INFO L477 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 13 treesize of output 10 [2018-11-10 10:32:23,468 INFO L477 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 10 treesize of output 9 [2018-11-10 10:32:23,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-10 10:32:23,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 10:32:23,540 INFO L477 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 22 treesize of output 21 [2018-11-10 10:32:23,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 10:32:23,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:23,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:32:23,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:32:23,692 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:37 [2018-11-10 10:32:23,737 INFO L477 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 23 treesize of output 20 [2018-11-10 10:32:23,739 INFO L477 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-11-10 10:32:23,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-11-10 10:32:23,819 INFO L477 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 48 treesize of output 47 [2018-11-10 10:32:23,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:23,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 10:32:23,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:23,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:32:24,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:32:24,018 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:71, output treesize:37 [2018-11-10 10:32:24,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2018-11-10 10:32:24,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:24,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:51 [2018-11-10 10:32:24,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-10 10:32:24,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:24,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2018-11-10 10:32:24,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-11-10 10:32:24,440 INFO L477 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 14 treesize of output 13 [2018-11-10 10:32:24,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,485 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-11-10 10:32:24,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:79 [2018-11-10 10:32:24,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-10 10:32:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2018-11-10 10:32:24,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:32:24,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:32:24,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-10 10:32:24,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:90, output treesize:148 [2018-11-10 10:32:24,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 33 [2018-11-10 10:32:24,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-10 10:32:24,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,832 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-11-10 10:32:24,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:49 [2018-11-10 10:32:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:24,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:47,036 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 10:33:01,386 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-10 10:33:01,539 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-10 10:33:01,765 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-10 10:33:01,952 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 10:33:01,973 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 81 [2018-11-10 10:33:02,160 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-11-10 10:33:02,169 INFO L477 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-11-10 10:33:02,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,238 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:02,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 75 [2018-11-10 10:33:02,563 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2018-11-10 10:33:02,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 47 treesize of output 57 [2018-11-10 10:33:02,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:02,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:02,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-11-10 10:33:02,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 10:33:03,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-11-10 10:33:03,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:33:03,478 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-11-10 10:33:03,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-10 10:33:03,496 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,736 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-10 10:33:03,752 INFO L477 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 32 treesize of output 24 [2018-11-10 10:33:03,753 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,779 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,783 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 10:33:03,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 10:33:03,802 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,829 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:03,833 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-10 10:33:03,849 INFO L477 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 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-10 10:33:03,849 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:03,864 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:04,057 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-10 10:33:04,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2018-11-10 10:33:04,110 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-10 10:33:04,110 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,121 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,153 INFO L477 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 13 treesize of output 8 [2018-11-10 10:33:04,153 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:04,170 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:04,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:04,179 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-11-10 10:33:04,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 33 [2018-11-10 10:33:04,228 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-10 10:33:04,228 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,237 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,260 INFO L477 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 6 treesize of output 1 [2018-11-10 10:33:04,260 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,271 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:33:04,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:33:04,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 10:33:04,479 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 10 variables, input treesize:145, output treesize:86 [2018-11-10 10:33:04,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:33:04,614 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:33:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:04,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:04,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:33:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:33:04,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:04,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:04,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:33:04,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:04,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:04,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-10 10:33:05,255 INFO L477 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 13 treesize of output 10 [2018-11-10 10:33:05,259 INFO L477 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 10 treesize of output 9 [2018-11-10 10:33:05,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-10 10:33:05,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 10:33:05,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 10:33:05,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:05,498 INFO L477 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 18 treesize of output 17 [2018-11-10 10:33:05,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:05,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:05,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:61 [2018-11-10 10:33:07,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2018-11-10 10:33:07,761 INFO L477 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 60 treesize of output 59 [2018-11-10 10:33:07,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:07,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 10:33:07,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:07,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:08,041 INFO L477 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 28 treesize of output 25 [2018-11-10 10:33:08,043 INFO L477 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-11-10 10:33:08,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:08,114 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:88, output treesize:54 [2018-11-10 10:33:08,230 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 10:33:08,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-11-10 10:33:08,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:08,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:51 [2018-11-10 10:33:08,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:08,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-10 10:33:08,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:08,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 [2018-11-10 10:33:08,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-10 10:33:08,746 INFO L477 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-11-10 10:33:08,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:08,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:66 [2018-11-10 10:33:08,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-11-10 10:33:08,931 INFO L477 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-11-10 10:33:08,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:08,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:68 [2018-11-10 10:33:09,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 33 [2018-11-10 10:33:09,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-10 10:33:09,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:09,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:09,065 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-11-10 10:33:09,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:49 [2018-11-10 10:33:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:09,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:33:11,129 WARN L832 $PredicateComparison]: unable to prove that (forall ((|append_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (v_subst_3 (_ BitVec 32)) (v_subst_4 (_ BitVec 32)) (|append_write~$Pointer$_#value.base| (_ BitVec 32))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_append_write~$Pointer$_old_#memory_$Pointer$.base| |c_append_write~$Pointer$_#ptr.base| (store (select |c_append_write~$Pointer$_old_#memory_$Pointer$.base| |c_append_write~$Pointer$_#ptr.base|) |append_write~$Pointer$_#ptr.offset| |append_write~$Pointer$_#value.base|)))) (store .cse0 c_append_~node~0.base (store (select .cse0 c_append_~node~0.base) v_subst_3 v_subst_4))) c_append_~head.base) (bvadd c_append_~head.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1))) is different from false [2018-11-10 10:33:21,543 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 10:33:24,010 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 10:33:24,189 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-10 10:33:24,426 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 10:33:24,680 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-10 10:33:24,696 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 64 [2018-11-10 10:33:24,843 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-11-10 10:33:24,852 INFO L477 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-11-10 10:33:24,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:24,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:24,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:24,910 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:24,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 67 [2018-11-10 10:33:25,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 31 [2018-11-10 10:33:25,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:25,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:33:25,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 45 [2018-11-10 10:33:25,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 10:33:25,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-10 10:33:25,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:33:25,681 INFO L477 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 44 treesize of output 38 [2018-11-10 10:33:25,699 INFO L477 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 32 treesize of output 24 [2018-11-10 10:33:25,699 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,732 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,737 INFO L477 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 44 treesize of output 38 [2018-11-10 10:33:25,761 INFO L477 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 32 treesize of output 24 [2018-11-10 10:33:25,762 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,810 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,816 INFO L477 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 40 treesize of output 36 [2018-11-10 10:33:25,822 INFO L477 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 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-10 10:33:25,822 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,838 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:25,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-10 10:33:25,974 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:123, output treesize:67 [2018-11-10 10:33:28,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:33:28,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 30 [2018-11-10 10:33:28,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 10:33:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 10:33:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1793, Unknown=21, NotChecked=86, Total=2070 [2018-11-10 10:33:28,445 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand 31 states. [2018-11-10 10:33:30,333 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-10 10:33:30,839 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-10 10:33:31,616 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 10:33:32,706 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2018-11-10 10:33:32,994 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2018-11-10 10:33:33,468 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-11-10 10:33:33,783 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 69 [2018-11-10 10:33:34,439 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-10 10:33:35,792 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-11-10 10:33:37,365 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-10 10:33:37,988 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-10 10:33:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:39,249 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-11-10 10:33:39,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 10:33:39,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-11-10 10:33:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:39,252 INFO L225 Difference]: With dead ends: 242 [2018-11-10 10:33:39,252 INFO L226 Difference]: Without dead ends: 242 [2018-11-10 10:33:39,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=487, Invalid=3528, Unknown=21, NotChecked=124, Total=4160 [2018-11-10 10:33:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-10 10:33:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 203. [2018-11-10 10:33:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-10 10:33:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-11-10 10:33:39,255 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 54 [2018-11-10 10:33:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:39,255 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-11-10 10:33:39,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 10:33:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-11-10 10:33:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 10:33:39,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:39,256 INFO L375 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, 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-11-10 10:33:39,257 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, appendErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 10:33:39,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -341317482, now seen corresponding path program 1 times [2018-11-10 10:33:39,257 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:39,257 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54e801c9-c400-4859-ae28-d7ebef6aa59e/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:33:39,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:39,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:39,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:33:39,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 10:33:39,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:39,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:39,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-10 10:33:39,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-11-10 10:33:39,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 10:33:39,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-11-10 10:33:39,915 INFO L477 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 13 treesize of output 10 [2018-11-10 10:33:39,918 INFO L477 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 10 treesize of output 9 [2018-11-10 10:33:39,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,950 INFO L477 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 13 treesize of output 10 [2018-11-10 10:33:39,953 INFO L477 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 10 treesize of output 9 [2018-11-10 10:33:39,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:39,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-11-10 10:33:40,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 10:33:40,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 10:33:40,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:40,196 INFO L477 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 18 treesize of output 17 [2018-11-10 10:33:40,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:40,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 10:33:40,348 INFO L477 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 22 treesize of output 21 [2018-11-10 10:33:40,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 10:33:40,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:40,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:40,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 10:33:40,545 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:59, output treesize:122 [2018-11-10 10:33:40,639 INFO L477 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 39 treesize of output 36 [2018-11-10 10:33:40,641 INFO L477 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-11-10 10:33:40,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 110 [2018-11-10 10:33:40,860 INFO L477 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 93 treesize of output 92 [2018-11-10 10:33:40,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 103 [2018-11-10 10:33:41,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:41,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:41,268 INFO L477 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 35 treesize of output 32 [2018-11-10 10:33:41,270 INFO L477 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-11-10 10:33:41,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2018-11-10 10:33:41,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 57 treesize of output 38 [2018-11-10 10:33:41,421 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,438 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 83 [2018-11-10 10:33:41,482 INFO L477 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 83 treesize of output 82 [2018-11-10 10:33:41,483 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2018-11-10 10:33:41,659 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:41,740 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:41,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:33:41,847 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:132, output treesize:83 [2018-11-10 10:33:41,917 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 10:33:41,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:41,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:41,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:41,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-11-10 10:33:41,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:41,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:41,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:73 [2018-11-10 10:33:42,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:42,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:33:42,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:42,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:42,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:42,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:42,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-10 10:33:42,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:40 [2018-11-10 10:33:42,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-11-10 10:33:42,321 INFO L477 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 14 treesize of output 13 [2018-11-10 10:33:42,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-11-10 10:33:42,365 INFO L477 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-11-10 10:33:42,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:42,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:55 [2018-11-10 10:33:42,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-10 10:33:42,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2018-11-10 10:33:42,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 10:33:42,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:33:42,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-11-10 10:33:42,599 INFO L477 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-11-10 10:33:42,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 10:33:42,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:77, output treesize:88 [2018-11-10 10:33:42,735 INFO L477 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 17 treesize of output 13 [2018-11-10 10:33:42,740 INFO L477 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 13 treesize of output 5 [2018-11-10 10:33:42,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,753 INFO L477 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 25 treesize of output 19 [2018-11-10 10:33:42,755 INFO L477 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 19 treesize of output 10 [2018-11-10 10:33:42,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:42,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2018-11-10 10:33:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:42,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:33:43,944 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-10 10:33:49,288 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-10 10:33:50,155 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 10:33:55,594 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-10 10:33:59,667 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 10:34:05,829 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 10:34:07,328 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 104 [2018-11-10 10:34:08,325 WARN L179 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-10 10:34:09,402 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 86 [2018-11-10 10:34:10,446 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 84 [2018-11-10 10:34:10,463 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 227 [2018-11-10 10:34:10,781 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-10 10:34:10,930 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 209 [2018-11-10 10:34:10,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 10:34:10,953 INFO L477 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 90 treesize of output 83 [2018-11-10 10:34:10,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:11,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 10:34:14,223 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 170 [2018-11-10 10:34:14,734 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2018-11-10 10:34:14,746 INFO L477 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-11-10 10:34:14,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:14,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:34:14,972 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-10 10:34:15,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 69 [2018-11-10 10:34:15,326 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-10 10:34:15,331 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2018-11-10 10:34:15,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-10 10:34:15,350 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:15,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:15,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 46 [2018-11-10 10:34:16,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2018-11-10 10:34:16,137 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:16,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:16,341 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:34:16,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 60 [2018-11-10 10:34:16,405 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-10 10:34:16,711 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:34:17,178 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 10:34:17,231 INFO L477 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 24 treesize of output 16 [2018-11-10 10:34:17,231 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:17,333 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:17,347 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 10:34:17,375 INFO L477 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 24 treesize of output 16 [2018-11-10 10:34:17,375 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:17,442 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:17,452 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 10:34:17,466 INFO L477 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 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 10:34:17,466 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,499 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:34:17,832 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-11-10 10:34:17,846 INFO L477 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 13 treesize of output 8 [2018-11-10 10:34:17,846 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:17,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 27 [2018-11-10 10:34:17,949 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-10 10:34:17,949 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,974 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,042 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:18,047 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:34:18,053 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-10 10:34:18,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 27 [2018-11-10 10:34:18,108 INFO L477 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 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-10 10:34:18,109 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,124 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,173 INFO L477 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 6 treesize of output 1 [2018-11-10 10:34:18,173 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,215 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:34:18,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:34:18,735 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 252 [2018-11-10 10:34:19,093 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2018-11-10 10:34:19,110 INFO L477 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-11-10 10:34:19,110 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:34:19,307 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-10 10:34:19,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 69 [2018-11-10 10:34:19,793 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-10 10:34:19,797 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:34:19,797 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,802 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-11-10 10:34:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-10 10:34:19,822 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:19,898 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:19,910 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-10 10:34:19,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-10 10:34:19,948 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:20,031 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:34:20,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 46 [2018-11-10 10:34:20,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 47 [2018-11-10 10:34:20,767 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-11-10 10:34:21,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 64 [2018-11-10 10:34:21,126 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-11-10 10:34:21,409 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 10:34:21,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:21,829 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-10 10:34:22,101 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:34:22,101 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_99 term size 26 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 10:34:22,104 INFO L168 Benchmark]: Toolchain (without parser) took 189819.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 944.4 MB in the beginning and 1.0 GB in the end (delta: -104.5 MB). Peak memory consumption was 395.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.98 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: Boogie Preprocessor took 31.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: RCFGBuilder took 653.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:22,105 INFO L168 Benchmark]: TraceAbstraction took 188705.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.7 MB). Peak memory consumption was 380.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:22,107 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.98 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -215.8 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 653.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 188705.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.7 MB). Peak memory consumption was 380.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_99 term size 26 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_99 term size 26: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...