./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:45:36,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:45:36,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:45:36,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:45:36,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:45:36,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:45:36,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:45:36,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:45:36,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:45:36,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:45:36,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:45:36,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:45:36,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:45:36,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:45:36,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:45:36,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:45:36,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:45:36,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:45:36,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:45:36,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:45:36,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:45:36,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:45:36,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:45:36,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:45:36,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:45:36,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:45:36,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:45:36,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:45:36,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:45:36,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:45:36,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:45:36,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:45:36,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:45:36,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:45:36,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:45:36,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:45:36,050 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 12:45:36,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:45:36,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:45:36,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:45:36,058 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:45:36,058 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:45:36,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:45:36,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:45:36,059 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:45:36,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:45:36,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:45:36,060 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:45:36,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:45:36,061 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_ade271dc-ad96-4660-867a-68960b44c8f9/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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-02 12:45:36,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:45:36,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:45:36,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:45:36,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:45:36,087 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:45:36,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:45:36,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/5c1488c4e/9e4d96814eb14685a8127216e41385ce/FLAGd1fb8797f [2018-12-02 12:45:36,580 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:45:36,580 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:45:36,587 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/5c1488c4e/9e4d96814eb14685a8127216e41385ce/FLAGd1fb8797f [2018-12-02 12:45:36,595 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/5c1488c4e/9e4d96814eb14685a8127216e41385ce [2018-12-02 12:45:36,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:45:36,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:45:36,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:45:36,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:45:36,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:45:36,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523e2e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36, skipping insertion in model container [2018-12-02 12:45:36,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:45:36,629 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:45:36,835 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:45:36,844 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:45:36,885 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:45:36,921 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:45:36,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36 WrapperNode [2018-12-02 12:45:36,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:45:36,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:45:36,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:45:36,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:45:36,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:45:36,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:45:36,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:45:36,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:45:36,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... [2018-12-02 12:45:36,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:45:36,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:45:36,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:45:36,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:45:36,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 12:45:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:45:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:45:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 12:45:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 12:45:36,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:45:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:45:37,100 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:45:37,100 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 12:45:37,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:45:37 BoogieIcfgContainer [2018-12-02 12:45:37,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:45:37,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:45:37,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:45:37,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:45:37,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:45:36" (1/3) ... [2018-12-02 12:45:37,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbedea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:45:37, skipping insertion in model container [2018-12-02 12:45:37,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:45:36" (2/3) ... [2018-12-02 12:45:37,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbedea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:45:37, skipping insertion in model container [2018-12-02 12:45:37,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:45:37" (3/3) ... [2018-12-02 12:45:37,105 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:45:37,110 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:45:37,114 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:45:37,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:45:37,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:45:37,138 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:45:37,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:45:37,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:45:37,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:45:37,138 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:45:37,138 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:45:37,138 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:45:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-02 12:45:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 12:45:37,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:37,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:37,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:37,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1493808756, now seen corresponding path program 1 times [2018-12-02 12:45:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:37,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:45:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:45:37,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:45:37,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:45:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:45:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:45:37,286 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-02 12:45:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:37,322 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-02 12:45:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:45:37,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 12:45:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:37,329 INFO L225 Difference]: With dead ends: 41 [2018-12-02 12:45:37,329 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 12:45:37,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:45:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 12:45:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-02 12:45:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 12:45:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 12:45:37,354 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-02 12:45:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:37,354 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 12:45:37,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:45:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 12:45:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 12:45:37,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:37,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:37,355 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:37,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1058348205, now seen corresponding path program 1 times [2018-12-02 12:45:37,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:37,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:45:37,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:45:37,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:45:37,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:45:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:45:37,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:45:37,386 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-02 12:45:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:37,414 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-02 12:45:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:45:37,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 12:45:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:37,415 INFO L225 Difference]: With dead ends: 39 [2018-12-02 12:45:37,415 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 12:45:37,416 INFO L631 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-12-02 12:45:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 12:45:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-02 12:45:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 12:45:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-02 12:45:37,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-02 12:45:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:37,419 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-02 12:45:37,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:45:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-02 12:45:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 12:45:37,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:37,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:37,420 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:37,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -936037343, now seen corresponding path program 1 times [2018-12-02 12:45:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:37,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:45:37,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:45:37,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:45:37,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:45:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:45:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:45:37,454 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-02 12:45:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:37,473 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-02 12:45:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:45:37,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 12:45:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:37,474 INFO L225 Difference]: With dead ends: 46 [2018-12-02 12:45:37,474 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 12:45:37,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:45:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 12:45:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 12:45:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 12:45:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-02 12:45:37,478 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-02 12:45:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:37,478 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 12:45:37,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:45:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-02 12:45:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:45:37,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:37,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:37,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:37,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -489509575, now seen corresponding path program 1 times [2018-12-02 12:45:37,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:37,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:37,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:37,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:45:37,558 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 12:45:37,559 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [32], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-02 12:45:37,579 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:45:37,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:45:37,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:45:37,667 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 26 variables. [2018-12-02 12:45:37,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:37,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:45:37,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:37,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:37,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:37,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:45:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:37,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:37,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:45:37,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:37,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:37,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 12:45:37,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:37,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:37,752 INFO L478 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-12-02 12:45:37,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:37,772 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-12-02 12:45:37,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 12:45:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:37,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:45:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:38,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:45:38,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2018-12-02 12:45:38,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:45:38,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:45:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:45:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2018-12-02 12:45:38,673 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 9 states. [2018-12-02 12:45:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:38,869 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-12-02 12:45:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:45:38,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-02 12:45:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:38,871 INFO L225 Difference]: With dead ends: 63 [2018-12-02 12:45:38,871 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 12:45:38,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2018-12-02 12:45:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 12:45:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2018-12-02 12:45:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 12:45:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-02 12:45:38,877 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-02 12:45:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:38,877 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-02 12:45:38,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:45:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-02 12:45:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:45:38,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:38,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:38,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:38,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash -489509574, now seen corresponding path program 1 times [2018-12-02 12:45:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:38,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:39,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:39,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:45:39,022 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 12:45:39,022 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [33], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-02 12:45:39,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:45:39,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:45:39,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:45:39,053 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 174 root evaluator evaluations with a maximum evaluation depth of 4. Performed 174 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 26 variables. [2018-12-02 12:45:39,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:39,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:45:39,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:39,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:39,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:39,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:45:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:39,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:39,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:45:39,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:45:39,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 12:45:39,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:39,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:39,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:45:39,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:45:39,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:39,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:45:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:39,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:45:39,243 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-02 12:45:48,988 WARN L180 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 72 DAG size of output: 25 [2018-12-02 12:45:49,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 12:45:49,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 12:45:49,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:49,102 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:45:49,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:49,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:49,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:45:49,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:49,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:49,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:26, output treesize:5 [2018-12-02 12:45:51,201 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-02 12:45:51,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:45:51,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 12:45:51,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 12:45:51,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,255 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:45:51,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:51,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:51,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:31, output treesize:14 [2018-12-02 12:45:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:51,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:45:51,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-02 12:45:51,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:45:51,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:45:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:45:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=293, Unknown=2, NotChecked=0, Total=342 [2018-12-02 12:45:51,316 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 11 states. [2018-12-02 12:45:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:51,603 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-02 12:45:51,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 12:45:51,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-02 12:45:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:51,604 INFO L225 Difference]: With dead ends: 60 [2018-12-02 12:45:51,604 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 12:45:51,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=116, Invalid=584, Unknown=2, NotChecked=0, Total=702 [2018-12-02 12:45:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 12:45:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-12-02 12:45:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:45:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-02 12:45:51,610 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-02 12:45:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:51,610 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-02 12:45:51,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:45:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-02 12:45:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:45:51,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:51,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:51,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:51,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash -782912582, now seen corresponding path program 1 times [2018-12-02 12:45:51,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:51,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:45:51,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:51,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:45:51,639 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 12:45:51,639 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [14], [16], [20], [28], [30], [32], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-02 12:45:51,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:45:51,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:45:51,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:45:51,665 INFO L272 AbstractInterpreter]: Visited 20 different actions 28 times. Merged at 2 different actions 4 times. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 3. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-12-02 12:45:51,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:51,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:45:51,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:51,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:51,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:45:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:45:51,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:45:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:45:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:45:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 5 [2018-12-02 12:45:51,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:45:51,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:45:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:45:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:45:51,735 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-02 12:45:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:51,742 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 12:45:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:45:51,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 12:45:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:51,743 INFO L225 Difference]: With dead ends: 32 [2018-12-02 12:45:51,743 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 12:45:51,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:45:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 12:45:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 12:45:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 12:45:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 12:45:51,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-02 12:45:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:51,746 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 12:45:51,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:45:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-02 12:45:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 12:45:51,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:51,747 INFO L402 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] [2018-12-02 12:45:51,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:51,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1470466568, now seen corresponding path program 1 times [2018-12-02 12:45:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:45:51,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:51,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:45:51,779 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 12:45:51,779 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [13], [14], [16], [20], [26], [28], [30], [31], [35], [39], [40], [41], [42], [44], [45], [46], [47], [48], [49] [2018-12-02 12:45:51,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:45:51,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:45:51,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:45:51,832 INFO L272 AbstractInterpreter]: Visited 24 different actions 59 times. Merged at 7 different actions 17 times. Never widened. Performed 510 root evaluator evaluations with a maximum evaluation depth of 4. Performed 510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-02 12:45:51,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:51,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:45:51,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:51,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:45:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:51,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:45:51,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:45:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:45:51,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:45:51,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-02 12:45:51,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:45:51,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:45:51,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:45:51,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:45:51,929 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2018-12-02 12:45:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:45:51,946 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-02 12:45:51,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:45:51,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 12:45:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:45:51,947 INFO L225 Difference]: With dead ends: 37 [2018-12-02 12:45:51,947 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 12:45:51,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:45:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 12:45:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-02 12:45:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 12:45:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 12:45:51,950 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2018-12-02 12:45:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:45:51,951 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 12:45:51,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:45:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 12:45:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 12:45:51,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:45:51,951 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:45:51,952 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:45:51,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -934990959, now seen corresponding path program 1 times [2018-12-02 12:45:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:45:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:45:51,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:45:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:45:52,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:52,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:45:52,112 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-02 12:45:52,112 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [14], [16], [20], [28], [30], [31], [33], [35], [40], [41], [42], [44], [46], [47], [48], [49] [2018-12-02 12:45:52,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:45:52,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:45:52,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:45:52,169 INFO L272 AbstractInterpreter]: Visited 21 different actions 54 times. Merged at 6 different actions 18 times. Never widened. Performed 519 root evaluator evaluations with a maximum evaluation depth of 4. Performed 519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-02 12:45:52,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:45:52,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:45:52,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:45:52,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:45:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:45:52,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:45:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:45:52,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:45:52,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:45:52,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:45:52,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 12:45:52,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:45:52,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:45:52,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:45:52,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:45:52,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:45:52,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:45:52,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:45:52,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:45:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:45:52,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:45:52,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-02 12:45:54,398 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~i~0_BEFORE_CALL_7 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_5 Int) (v_entry_point_~array~0.base_BEFORE_CALL_7 Int)) (let ((.cse0 (* 4 v_entry_point_~i~0_BEFORE_CALL_7))) (or (<= (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_5 4) (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_7)) (exists ((|v_ldv_malloc_#t~malloc12.base_35| Int) (v_ldv_malloc_~size_38 Int)) (and (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_35|) 0) (< (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_35| v_ldv_malloc_~size_38) v_entry_point_~array~0.base_BEFORE_CALL_7) (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_7) v_entry_point_~array~0.offset_BEFORE_CALL_5 4)))) (< (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_5) 0)))) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int)) (or (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (and (< (select (store |c_old(#length)| v_prenex_18 v_prenex_19) v_prenex_17) (+ v_prenex_16 (* 4 v_prenex_15) 4)) (= (select |c_old(#valid)| v_prenex_18) 0))) (<= 0 (+ v_prenex_16 (* 4 v_prenex_15))))) (exists ((v_prenex_14 Int)) (= 0 (select |c_old(#valid)| v_prenex_14)))) (or (forall ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (<= (+ (* 4 v_prenex_22) v_prenex_20 4) (select |c_#length| v_prenex_21)) (exists ((v_prenex_25 Int) (v_prenex_24 Int)) (and (= (select |c_old(#valid)| v_prenex_25) 0) (< (select (store |c_old(#length)| v_prenex_25 v_prenex_24) v_prenex_21) (+ (* 4 v_prenex_22) v_prenex_20 4)))))) (exists ((v_prenex_23 Int)) (= 0 (select |c_old(#valid)| v_prenex_23))))) is different from false [2018-12-02 12:45:54,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-02 12:45:54,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-12-02 12:45:56,582 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:45:56,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:56,587 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:45:56,588 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:45:56,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-02 12:45:56,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:45:56,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:45:56,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:25 [2018-12-02 12:45:58,660 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_6 Int) (|v_ldv_malloc_#t~malloc12.base_35| Int) (v_entry_point_~i~0_BEFORE_CALL_8 Int) (v_entry_point_~array~0.base_BEFORE_CALL_8 Int) (v_ldv_malloc_~size_38 Int)) (let ((.cse0 (* 4 v_entry_point_~i~0_BEFORE_CALL_8))) (or (<= (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 .cse0 8) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_35| v_ldv_malloc_~size_38) v_entry_point_~array~0.base_BEFORE_CALL_8)) (exists ((|v_ldv_malloc_#t~malloc12.base_39| Int) (v_ldv_malloc_~size_42 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (and (< (select (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_39| v_ldv_malloc_~size_42) v_prenex_30 v_prenex_31) v_entry_point_~array~0.base_BEFORE_CALL_8) (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 (* 4 v_entry_point_~i~0_BEFORE_CALL_8) 8)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_39|) 0) (not (= v_prenex_30 v_entry_point_~array~0.base_BEFORE_CALL_8)))) (= |v_ldv_malloc_#t~malloc12.base_35| v_entry_point_~array~0.base_BEFORE_CALL_8) (< (+ v_entry_point_~array~0.offset_BEFORE_CALL_6 .cse0) 0)))) is different from false [2018-12-02 12:46:13,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 12:46:13,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:13,897 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-02 12:46:13,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-02 12:46:13,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,909 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:46:13,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:46:13,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:13,929 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:32, output treesize:5 [2018-12-02 12:46:15,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:46:15,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:15,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 14 treesize of output 18 [2018-12-02 12:46:15,992 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-02 12:46:16,007 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:46:16,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-02 12:46:16,010 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:16,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:16,018 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:37, output treesize:14 [2018-12-02 12:46:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 12:46:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:46:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 27 [2018-12-02 12:46:16,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:46:16,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 12:46:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 12:46:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=559, Unknown=11, NotChecked=98, Total=756 [2018-12-02 12:46:16,066 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2018-12-02 12:46:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:46:22,113 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-02 12:46:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:46:22,114 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-12-02 12:46:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:46:22,114 INFO L225 Difference]: With dead ends: 56 [2018-12-02 12:46:22,114 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 12:46:22,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=200, Invalid=1127, Unknown=13, NotChecked=142, Total=1482 [2018-12-02 12:46:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 12:46:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2018-12-02 12:46:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 12:46:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-02 12:46:22,117 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 31 [2018-12-02 12:46:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:46:22,117 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-02 12:46:22,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 12:46:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-02 12:46:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:46:22,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:46:22,118 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:46:22,118 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:46:22,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:46:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash -247704063, now seen corresponding path program 2 times [2018-12-02 12:46:22,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:46:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:46:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:22,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:46:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:46:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:22,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:46:22,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:46:22,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 12:46:22,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 12:46:22,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:46:22,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:46:22,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:46:22,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 12:46:22,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:46:22,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:46:22,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:46:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:22,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:46:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:22,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 12:46:22,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-02 12:46:22,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 12:46:22,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:46:22,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:46:22,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:46:22,250 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 9 states. [2018-12-02 12:46:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:46:22,277 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-02 12:46:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:46:22,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-02 12:46:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:46:22,278 INFO L225 Difference]: With dead ends: 42 [2018-12-02 12:46:22,278 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 12:46:22,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:46:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 12:46:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-12-02 12:46:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 12:46:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-12-02 12:46:22,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 36 [2018-12-02 12:46:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:46:22,280 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-12-02 12:46:22,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:46:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-12-02 12:46:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:46:22,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:46:22,281 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:46:22,281 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:46:22,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:46:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash 230022938, now seen corresponding path program 2 times [2018-12-02 12:46:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:46:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:22,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:46:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:46:22,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:46:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:46:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:22,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:46:22,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 12:46:22,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 12:46:22,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 12:46:22,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:46:22,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:46:22,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:46:22,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 12:46:22,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 12:46:22,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:46:22,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:46:22,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:46:22,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:46:22,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 12:46:22,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:46:22,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:46:22,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:22,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 12:46:22,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:46:22,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:46:22,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:22,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 12:46:22,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:46:22,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:46:22,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:46:22,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:22,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:22,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:24 [2018-12-02 12:46:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 12:46:22,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:46:22,798 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-12-02 12:46:31,256 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 25 [2018-12-02 12:46:31,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:31,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:31,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-02 12:46:31,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:31,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:31,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:25 [2018-12-02 12:46:33,461 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~i~0_BEFORE_CALL_17 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_11 Int) (v_entry_point_~array~0.base_BEFORE_CALL_13 Int)) (or (exists ((|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int)) (and (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_69|) 0) (< (select (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_13) (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11 8)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_13)))) (< (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11) 0) (forall ((v_prenex_45 Int) (v_prenex_44 Int)) (or (= v_prenex_44 v_entry_point_~array~0.base_BEFORE_CALL_13) (<= (+ (* 4 v_entry_point_~i~0_BEFORE_CALL_17) v_entry_point_~array~0.offset_BEFORE_CALL_11 8) (select (store |c_#length| v_prenex_44 v_prenex_45) v_entry_point_~array~0.base_BEFORE_CALL_13)))))) is different from false [2018-12-02 12:46:48,898 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:48,898 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:46:48,899 INFO L478 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 13 treesize of output 3 [2018-12-02 12:46:48,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:46:48,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 12:46:48,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:35 [2018-12-02 12:46:58,362 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 12:47:00,367 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~i~0_BEFORE_CALL_18 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~array~0.base_BEFORE_CALL_14 Int)) (or (forall ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_prenex_50 Int)) (let ((.cse0 (* 4 v_prenex_46))) (or (< (+ v_entry_point_~i~0_BEFORE_CALL_18 1) v_prenex_46) (< (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12) 0) (= v_prenex_47 v_entry_point_~array~0.base_BEFORE_CALL_14) (= v_prenex_49 v_entry_point_~array~0.base_BEFORE_CALL_14) (<= (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12 8) (select (store (store |c_#length| v_prenex_49 v_prenex_50) v_prenex_47 v_prenex_48) v_entry_point_~array~0.base_BEFORE_CALL_14))))) (exists ((v_ldv_malloc_~size_76 Int) (|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int) (v_entry_point_~i~0_34 Int) (|v_ldv_malloc_#t~malloc12.base_73| Int)) (let ((.cse1 (* 4 v_entry_point_~i~0_34))) (and (< (select (store (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_73| v_ldv_malloc_~size_76) |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_14) (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12 8)) (<= 0 (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12)) (<= v_entry_point_~i~0_34 (+ v_entry_point_~i~0_BEFORE_CALL_18 1)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_14)) (not (= |v_ldv_malloc_#t~malloc12.base_69| v_entry_point_~array~0.base_BEFORE_CALL_14)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_73|) 0)))))) is different from false [2018-12-02 12:47:02,381 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_prenex_49 Int) (v_prenex_48 Int) (v_entry_point_~i~0_BEFORE_CALL_18 Int) (v_prenex_47 Int) (v_prenex_46 Int) (v_entry_point_~array~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~array~0.base_BEFORE_CALL_14 Int) (v_prenex_50 Int)) (let ((.cse0 (* 4 v_prenex_46))) (or (< (+ v_entry_point_~i~0_BEFORE_CALL_18 1) v_prenex_46) (< (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12) 0) (= v_prenex_47 v_entry_point_~array~0.base_BEFORE_CALL_14) (= v_prenex_49 v_entry_point_~array~0.base_BEFORE_CALL_14) (<= (+ .cse0 v_entry_point_~array~0.offset_BEFORE_CALL_12 8) (select (store (store |c_#length| v_prenex_49 v_prenex_50) v_prenex_47 v_prenex_48) v_entry_point_~array~0.base_BEFORE_CALL_14)) (exists ((v_ldv_malloc_~size_76 Int) (|v_ldv_malloc_#t~malloc12.base_65| Int) (v_ldv_malloc_~size_68 Int) (|v_ldv_malloc_#t~malloc12.base_69| Int) (v_ldv_malloc_~size_72 Int) (v_entry_point_~i~0_34 Int) (|v_ldv_malloc_#t~malloc12.base_73| Int)) (let ((.cse1 (* 4 v_entry_point_~i~0_34))) (and (< (select (store (store (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_73| v_ldv_malloc_~size_76) |v_ldv_malloc_#t~malloc12.base_69| v_ldv_malloc_~size_72) |v_ldv_malloc_#t~malloc12.base_65| v_ldv_malloc_~size_68) v_entry_point_~array~0.base_BEFORE_CALL_14) (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12 8)) (<= 0 (+ .cse1 v_entry_point_~array~0.offset_BEFORE_CALL_12)) (<= v_entry_point_~i~0_34 (+ v_entry_point_~i~0_BEFORE_CALL_18 1)) (not (= |v_ldv_malloc_#t~malloc12.base_65| v_entry_point_~array~0.base_BEFORE_CALL_14)) (not (= |v_ldv_malloc_#t~malloc12.base_69| v_entry_point_~array~0.base_BEFORE_CALL_14)) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_73|) 0))))))) is different from false [2018-12-02 12:47:25,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 25 [2018-12-02 12:47:25,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:47:25,799 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-02 12:47:25,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2018-12-02 12:47:25,857 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:47:25,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-12-02 12:47:25,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-02 12:47:25,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 12:47:25,889 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 12:47:25,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:47:25,908 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:25,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:47:25,915 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:50, output treesize:18 [2018-12-02 12:47:28,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 12:47:28,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 12:47:28,118 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-12-02 12:47:28,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2018-12-02 12:47:28,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2018-12-02 12:47:28,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 12:47:28,180 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 12:47:28,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2018-12-02 12:47:28,190 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 12:47:28,222 INFO L478 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 22 treesize of output 11 [2018-12-02 12:47:28,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:28,453 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:28,454 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) 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:418) 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:214) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-02 12:47:28,459 INFO L168 Benchmark]: Toolchain (without parser) took 111861.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 948.1 MB in the beginning and 970.4 MB in the end (delta: -22.3 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:28,460 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:28,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:28,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:28,461 INFO L168 Benchmark]: Boogie Preprocessor took 15.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:28,461 INFO L168 Benchmark]: RCFGBuilder took 142.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:28,462 INFO L168 Benchmark]: TraceAbstraction took 111356.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 98.0 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:28,464 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 142.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111356.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 11.5 MB). Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 98.0 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:47:29,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:47:29,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:47:29,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:47:29,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:47:29,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:47:29,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:47:29,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:47:29,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:47:29,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:47:29,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:47:29,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:47:29,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:47:29,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:47:29,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:47:29,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:47:29,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:47:29,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:47:29,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:47:29,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:47:29,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:47:29,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:47:29,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:47:29,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:47:29,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:47:29,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:47:29,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:47:29,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:47:29,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:47:29,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:47:29,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:47:29,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:47:29,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:47:29,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:47:29,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:47:29,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:47:29,753 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 12:47:29,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:47:29,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:47:29,761 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:47:29,761 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:47:29,761 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:47:29,762 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:47:29,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 12:47:29,762 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:47:29,763 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:47:29,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:47:29,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:47:29,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:47:29,764 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 12:47:29,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:47:29,764 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 12:47:29,764 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_ade271dc-ad96-4660-867a-68960b44c8f9/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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-02 12:47:29,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:47:29,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:47:29,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:47:29,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:47:29,793 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:47:29,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:47:29,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/11d3efe7f/061492f48e7f45ff9c33c353278c12f7/FLAG20745222a [2018-12-02 12:47:30,261 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:47:30,261 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:47:30,268 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/11d3efe7f/061492f48e7f45ff9c33c353278c12f7/FLAG20745222a [2018-12-02 12:47:30,276 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/data/11d3efe7f/061492f48e7f45ff9c33c353278c12f7 [2018-12-02 12:47:30,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:47:30,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:47:30,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:47:30,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:47:30,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:47:30,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73418f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30, skipping insertion in model container [2018-12-02 12:47:30,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:47:30,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:47:30,499 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:47:30,512 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:47:30,584 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:47:30,617 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:47:30,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30 WrapperNode [2018-12-02 12:47:30,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:47:30,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:47:30,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:47:30,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:47:30,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:47:30,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:47:30,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:47:30,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:47:30,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:47:30,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:47:30,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:47:30,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:47:30,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:47:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 12:47:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:47:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:47:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 12:47:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 12:47:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:47:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:47:30,832 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:47:30,832 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 12:47:30,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:30 BoogieIcfgContainer [2018-12-02 12:47:30,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:47:30,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:47:30,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:47:30,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:47:30,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:47:30" (1/3) ... [2018-12-02 12:47:30,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578aaf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:30, skipping insertion in model container [2018-12-02 12:47:30,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30" (2/3) ... [2018-12-02 12:47:30,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578aaf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:30, skipping insertion in model container [2018-12-02 12:47:30,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:30" (3/3) ... [2018-12-02 12:47:30,837 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 12:47:30,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:47:30,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:47:30,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:47:30,868 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:47:30,869 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:47:30,869 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 12:47:30,869 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:47:30,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:47:30,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:47:30,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:47:30,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:47:30,869 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:47:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-02 12:47:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 12:47:30,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:30,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:30,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:30,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1493808756, now seen corresponding path program 1 times [2018-12-02 12:47:30,889 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:30,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:30,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:30,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:47:30,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:30,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:30,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:30,999 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-02 12:47:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:31,067 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-02 12:47:31,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:47:31,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 12:47:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:31,075 INFO L225 Difference]: With dead ends: 41 [2018-12-02 12:47:31,075 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 12:47:31,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 12:47:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-02 12:47:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 12:47:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 12:47:31,101 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-02 12:47:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 12:47:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 12:47:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 12:47:31,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:31,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:31,103 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:31,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1058348205, now seen corresponding path program 1 times [2018-12-02 12:47:31,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:31,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:31,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:31,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:47:31,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:31,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:47:31,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:47:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:47:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:31,156 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-02 12:47:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:31,203 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-02 12:47:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:47:31,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 12:47:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:31,206 INFO L225 Difference]: With dead ends: 39 [2018-12-02 12:47:31,206 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 12:47:31,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 12:47:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-02 12:47:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 12:47:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-02 12:47:31,211 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-02 12:47:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:31,212 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-02 12:47:31,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:47:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-02 12:47:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 12:47:31,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:31,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:31,213 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:31,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash -936037343, now seen corresponding path program 1 times [2018-12-02 12:47:31,213 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:31,214 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:31,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:31,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:31,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:47:31,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:31,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:31,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:31,278 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-02 12:47:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:31,314 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-02 12:47:31,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:47:31,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 12:47:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:31,316 INFO L225 Difference]: With dead ends: 46 [2018-12-02 12:47:31,316 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 12:47:31,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 12:47:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 12:47:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 12:47:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-02 12:47:31,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-02 12:47:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:31,323 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 12:47:31,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-02 12:47:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:47:31,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:31,324 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:31,324 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -489509575, now seen corresponding path program 1 times [2018-12-02 12:47:31,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:31,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:31,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:31,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:31,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:31,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:31,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 12:47:33,459 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:47:33,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:33,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:33,471 INFO L478 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-12-02 12:47:33,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:33,480 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-12-02 12:47:33,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-02 12:47:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 12:47:33,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:33,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:33,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:33,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:33,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:33,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:33,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:33,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:33,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 12:47:33,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:33,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:33,600 INFO L478 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-12-02 12:47:33,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:33,608 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-12-02 12:47:33,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 12:47:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 12:47:33,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:33,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:47:33,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 12:47:33,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:47:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:47:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-12-02 12:47:33,676 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2018-12-02 12:47:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:37,952 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-12-02 12:47:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:47:37,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-02 12:47:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:37,954 INFO L225 Difference]: With dead ends: 53 [2018-12-02 12:47:37,954 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 12:47:37,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2018-12-02 12:47:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 12:47:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-12-02 12:47:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 12:47:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-02 12:47:37,959 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-02 12:47:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:37,959 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-02 12:47:37,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:47:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-02 12:47:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:47:37,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:37,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:37,960 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:37,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -489509574, now seen corresponding path program 1 times [2018-12-02 12:47:37,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:38,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:38,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:38,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:38,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:38,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:38,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:38,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:39,182 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:47:39,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:39,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:39,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:47:39,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:39,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:47:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 12:47:39,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:39,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:39,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:39,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:39,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:39,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:39,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:39,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:39,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:39,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:39,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:39,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:39,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:39,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 12:47:39,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:39,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:47:39,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 12:47:39,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:47:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:47:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2018-12-02 12:47:39,769 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 10 states. [2018-12-02 12:47:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:40,229 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-02 12:47:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:47:40,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 12:47:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:40,231 INFO L225 Difference]: With dead ends: 49 [2018-12-02 12:47:40,231 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 12:47:40,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2018-12-02 12:47:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 12:47:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-12-02 12:47:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 12:47:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-02 12:47:40,234 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-02 12:47:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:40,234 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-02 12:47:40,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:47:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-02 12:47:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:47:40,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:40,235 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:40,235 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:40,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash -782912582, now seen corresponding path program 1 times [2018-12-02 12:47:40,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:40,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:40,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:40,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:47:40,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:40,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:40,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:40,300 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-02 12:47:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:40,321 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 12:47:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:47:40,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 12:47:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:40,322 INFO L225 Difference]: With dead ends: 32 [2018-12-02 12:47:40,322 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 12:47:40,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 12:47:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 12:47:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 12:47:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 12:47:40,334 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-02 12:47:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:40,335 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 12:47:40,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-02 12:47:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 12:47:40,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:40,335 INFO L402 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] [2018-12-02 12:47:40,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:40,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1470466568, now seen corresponding path program 1 times [2018-12-02 12:47:40,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:40,336 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:40,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:40,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:47:40,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:47:40,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:40,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:40,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:40,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:47:40,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:47:40,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 12:47:40,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-12-02 12:47:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:47:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:47:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:47:40,524 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-12-02 12:47:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:40,624 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-12-02 12:47:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:40,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 12:47:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:40,625 INFO L225 Difference]: With dead ends: 44 [2018-12-02 12:47:40,625 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 12:47:40,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:47:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 12:47:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-02 12:47:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:47:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-12-02 12:47:40,628 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 27 [2018-12-02 12:47:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:40,628 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-12-02 12:47:40,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:47:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-12-02 12:47:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 12:47:40,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:40,629 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:40,629 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:40,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash -934990959, now seen corresponding path program 1 times [2018-12-02 12:47:40,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:40,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:40,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:40,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:40,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:40,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:40,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:40,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:40,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:41,650 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:47:41,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:41,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:41,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:41,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:41,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:41,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:41,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:41,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:41,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:41,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:41,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:41,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-02 12:47:41,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:42,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:42,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:42,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:42,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:42,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:42,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:42,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:42,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:42,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:42,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:42,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:42,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:42,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:42,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:42,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:42,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:42,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-02 12:47:42,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:47:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 12:47:42,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:47:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:47:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2018-12-02 12:47:42,438 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 12 states. [2018-12-02 12:47:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:42,959 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-12-02 12:47:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:47:42,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-02 12:47:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:42,960 INFO L225 Difference]: With dead ends: 46 [2018-12-02 12:47:42,960 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 12:47:42,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2018-12-02 12:47:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 12:47:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-02 12:47:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:47:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-02 12:47:42,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 31 [2018-12-02 12:47:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:42,962 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-02 12:47:42,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:47:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-02 12:47:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:47:42,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:42,963 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:42,963 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:42,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 230022938, now seen corresponding path program 2 times [2018-12-02 12:47:42,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:42,977 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 12:47:43,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:47:43,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:43,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:43,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:43,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:43,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:43,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:43,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:43,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:43,995 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:47:44,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:44,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:44,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:44,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:44,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:44,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2018-12-02 12:47:44,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:44,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:44,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:44,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:47:44,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:47:44,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:44,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:44,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:44,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:44,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:44,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:44,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:44,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:44,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:44,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:44,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:44,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:44,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:44,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2018-12-02 12:47:44,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:44,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:47:44,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-02 12:47:44,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 12:47:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 12:47:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2018-12-02 12:47:44,901 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 14 states. [2018-12-02 12:47:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:45,627 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-02 12:47:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:47:45,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-12-02 12:47:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:45,628 INFO L225 Difference]: With dead ends: 48 [2018-12-02 12:47:45,628 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 12:47:45,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2018-12-02 12:47:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 12:47:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-12-02 12:47:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 12:47:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-12-02 12:47:45,631 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2018-12-02 12:47:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:45,631 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-12-02 12:47:45,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 12:47:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-12-02 12:47:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 12:47:45,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:45,632 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:45,632 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:45,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash -72608335, now seen corresponding path program 3 times [2018-12-02 12:47:45,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:45,648 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 12:47:45,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 12:47:45,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:45,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:45,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:45,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:45,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:45,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:45,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:45,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:46,858 WARN L180 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 12:47:46,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:46,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:46,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:46,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:46,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 12:47:46,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:46,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:46,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:46,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:46,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:46,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:46,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 12:47:48,130 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:47:48,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:48,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:48,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:48,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:47:48,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:48,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:47:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 12 not checked. [2018-12-02 12:47:48,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:48,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:48,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:47:48,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 12:47:48,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:48,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:48,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:48,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:47:48,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:47:48,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:48,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:48,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:48,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:48,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:48,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:48,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:48,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:48,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:48,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:47:48,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:49,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:49,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:47:49,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:49,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:47:49,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:47:49,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:49,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:47:49,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:47:49,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:47:49,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:47:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2018-12-02 12:47:49,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:49,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:47:49,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 18 [2018-12-02 12:47:49,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 12:47:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 12:47:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2018-12-02 12:47:49,323 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 19 states. [2018-12-02 12:47:51,735 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-02 12:47:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:58,345 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-12-02 12:47:58,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:47:58,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-02 12:47:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:58,346 INFO L225 Difference]: With dead ends: 54 [2018-12-02 12:47:58,346 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 12:47:58,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2018-12-02 12:47:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 12:47:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 12:47:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 12:47:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-02 12:47:58,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 49 [2018-12-02 12:47:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:58,350 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-02 12:47:58,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 12:47:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-12-02 12:47:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:47:58,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:58,351 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:58,351 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:58,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1915928545, now seen corresponding path program 2 times [2018-12-02 12:47:58,351 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:58,351 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:58,365 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 12:47:58,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:47:58,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:58,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 12:47:58,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 12:47:58,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:47:58,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:47:58,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:47:58,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:47:58,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:47:58,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:47:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 12:47:58,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:47:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 12:47:58,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 12:47:58,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10] total 19 [2018-12-02 12:47:58,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 12:47:58,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 12:47:58,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-12-02 12:47:58,946 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 19 states. [2018-12-02 12:47:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:59,935 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-02 12:47:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:47:59,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-12-02 12:47:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:59,936 INFO L225 Difference]: With dead ends: 77 [2018-12-02 12:47:59,936 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 12:47:59,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=464, Unknown=0, NotChecked=0, Total=702 [2018-12-02 12:47:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 12:47:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-12-02 12:47:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:47:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2018-12-02 12:47:59,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 54 [2018-12-02 12:47:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:59,942 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2018-12-02 12:47:59,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 12:47:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2018-12-02 12:47:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 12:47:59,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:59,943 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:59,943 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:47:59,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -140224262, now seen corresponding path program 4 times [2018-12-02 12:47:59,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:47:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:47:59,958 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:48:00,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:48:00,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:48:00,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:00,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:00,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:00,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:00,876 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:48:00,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:00,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:00,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:00,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:00,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:48:00,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:00,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:00,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:00,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:00,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:00,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:48:01,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:01,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:48:01,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:01,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:48:01,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:01,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-02 12:48:01,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:48:01,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:48:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:48:01,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:48:01,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:48:01,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:01,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:01,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:01,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:01,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:01,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,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-12-02 12:48:01,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:01,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:01,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:48:01,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:48:01,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:01,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:48:01,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:48:01,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:01,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:01,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:01,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:01,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:01,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:01,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-02 12:48:01,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:02,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:48:02,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-12-02 12:48:02,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 12:48:02,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 12:48:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2018-12-02 12:48:02,149 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 18 states. [2018-12-02 12:48:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:48:03,397 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-12-02 12:48:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:48:03,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-02 12:48:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:48:03,399 INFO L225 Difference]: With dead ends: 82 [2018-12-02 12:48:03,399 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 12:48:03,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=138, Invalid=921, Unknown=1, NotChecked=62, Total=1122 [2018-12-02 12:48:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 12:48:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-02 12:48:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:48:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2018-12-02 12:48:03,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 58 [2018-12-02 12:48:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:48:03,403 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2018-12-02 12:48:03,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 12:48:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2018-12-02 12:48:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:48:03,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:48:03,404 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:48:03,405 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:48:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:48:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash -734480431, now seen corresponding path program 5 times [2018-12-02 12:48:03,405 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:48:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:48:03,419 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-02 12:48:03,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-02 12:48:03,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:48:03,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:03,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:03,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:03,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:03,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 12:48:04,730 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| |c_ldv_malloc_#in~size|))) is different from true [2018-12-02 12:48:04,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:04,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 12:48:04,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:48:04,756 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-12-02 12:48:04,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-12-02 12:48:05,855 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:48:05,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:05,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:05,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 12:48:05,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:05,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:05,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:05,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:05,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 56 [2018-12-02 12:48:05,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 12:48:06,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:06,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:06,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-02 12:48:06,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:06,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:06,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:06,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-12-02 12:48:06,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:06,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 12:48:06,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:06,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 12:48:06,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:74, output treesize:54 [2018-12-02 12:48:08,079 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:48:08,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:08,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,106 INFO L478 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-12-02 12:48:08,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,119 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-12-02 12:48:08,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-02 12:48:08,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,203 INFO L478 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-12-02 12:48:08,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,239 INFO L478 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 24 treesize of output 36 [2018-12-02 12:48:08,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:08,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-12-02 12:48:08,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,362 INFO L478 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 23 treesize of output 25 [2018-12-02 12:48:08,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-12-02 12:48:08,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:14 [2018-12-02 12:48:08,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:08,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:08,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:08,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:08,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 28 trivial. 34 not checked. [2018-12-02 12:48:08,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:08,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:48:08,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:48:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 12:48:10,020 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-02 12:48:10,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:48:10,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:10,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:10,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:10,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:10,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:10,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:10,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,227 INFO L478 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-12-02 12:48:10,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:10,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,257 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-12-02 12:48:10,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:31 [2018-12-02 12:48:10,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,343 INFO L478 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-12-02 12:48:10,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,376 INFO L478 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 22 treesize of output 34 [2018-12-02 12:48:10,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:10,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:45, output treesize:42 [2018-12-02 12:48:10,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,505 INFO L478 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 14 treesize of output 17 [2018-12-02 12:48:10,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,565 INFO L478 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 27 treesize of output 51 [2018-12-02 12:48:10,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:10,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:59 [2018-12-02 12:48:10,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 12:48:10,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:10,863 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:48:10,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-12-02 12:48:10,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:10,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:10,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:80, output treesize:84 [2018-12-02 12:48:13,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:13,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:13,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:13,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:13,278 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:48:13,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-12-02 12:48:13,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:13,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 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-12-02 12:48:13,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:13,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:13,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:95, output treesize:14 [2018-12-02 12:48:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 76 refuted. 0 times theorem prover too weak. 44 trivial. 28 not checked. [2018-12-02 12:48:13,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:13,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:48:13,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 35 [2018-12-02 12:48:13,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 12:48:13,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 12:48:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1060, Unknown=3, NotChecked=204, Total=1406 [2018-12-02 12:48:13,649 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand 36 states. [2018-12-02 12:48:21,052 WARN L180 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-02 12:48:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:48:28,002 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2018-12-02 12:48:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 12:48:28,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-02 12:48:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:48:28,003 INFO L225 Difference]: With dead ends: 126 [2018-12-02 12:48:28,003 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 12:48:28,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=305, Invalid=2784, Unknown=3, NotChecked=330, Total=3422 [2018-12-02 12:48:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 12:48:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-12-02 12:48:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 12:48:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2018-12-02 12:48:28,008 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 67 [2018-12-02 12:48:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:48:28,008 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2018-12-02 12:48:28,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 12:48:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2018-12-02 12:48:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:48:28,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:48:28,008 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:48:28,009 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:48:28,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:48:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1550383024, now seen corresponding path program 1 times [2018-12-02 12:48:28,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:48:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:48:28,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:48:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:48:28,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:28,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:28,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:28,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:28,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:28,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:28,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:29,138 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:48:29,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:29,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:29,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:29,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:29,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:48:29,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:48:29,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:29,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:29,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:29,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:29,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:29,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:29,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:29,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:29,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 20 not checked. [2018-12-02 12:48:29,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:29,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:48:29,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:48:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:48:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:48:29,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:29,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:29,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:29,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:29,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:29,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:29,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:29,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:30,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:30,654 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:48:30,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:30,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,681 INFO L478 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-12-02 12:48:30,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,695 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-12-02 12:48:30,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2018-12-02 12:48:30,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,824 INFO L478 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-12-02 12:48:30,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:48:30,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:48:30,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 12:48:30,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:30,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:30,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:30,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:30,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:30,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:30,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:30,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 28 not checked. [2018-12-02 12:48:30,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:48:31,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 22 [2018-12-02 12:48:31,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 12:48:31,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 12:48:31,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2018-12-02 12:48:31,209 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand 23 states. [2018-12-02 12:48:33,060 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:48:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:48:34,661 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2018-12-02 12:48:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 12:48:34,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-12-02 12:48:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:48:34,662 INFO L225 Difference]: With dead ends: 107 [2018-12-02 12:48:34,662 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 12:48:34,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=170, Invalid=1168, Unknown=2, NotChecked=142, Total=1482 [2018-12-02 12:48:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 12:48:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 72. [2018-12-02 12:48:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:48:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-12-02 12:48:34,666 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 67 [2018-12-02 12:48:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:48:34,666 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-12-02 12:48:34,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 12:48:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-12-02 12:48:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 12:48:34,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:48:34,666 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:48:34,666 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:48:34,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:48:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -10741030, now seen corresponding path program 6 times [2018-12-02 12:48:34,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:48:34,667 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:48:34,681 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-02 12:48:35,437 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 12:48:35,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:48:35,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:48:35,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:35,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:35,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:48:35,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:35,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:35,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:48:37,029 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:48:37,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:48:37,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,059 INFO L478 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-12-02 12:48:37,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,073 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-12-02 12:48:37,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-12-02 12:48:37,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,133 INFO L478 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 24 treesize of output 36 [2018-12-02 12:48:37,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,164 INFO L478 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-12-02 12:48:37,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:37,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2018-12-02 12:48:37,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,265 INFO L478 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 14 treesize of output 17 [2018-12-02 12:48:37,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:37,327 INFO L478 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 31 treesize of output 55 [2018-12-02 12:48:37,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:37,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:48:37,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:62 [2018-12-02 12:48:38,527 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 12:48:38,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 12:48:38,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-12-02 12:48:38,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:18 [2018-12-02 12:48:38,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:38,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:38,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 12:48:38,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:38,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:38,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:38,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:38,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 12:48:39,874 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:48:39,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:39,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:48:39,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:39,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:39,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:48:39,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:48:39,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:48:39,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:48:39,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:48:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 112 refuted. 0 times theorem prover too weak. 54 trivial. 38 not checked. [2018-12-02 12:48:39,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:48:40,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:48:40,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:48:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 12:49:01,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 12:49:01,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:01,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:01,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:01,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:01,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:01,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:01,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:01,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:01,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:01,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:01,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:01,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:01,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:01,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:01,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:01,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12-02 12:49:01,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:01,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:01,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:01,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:01,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:01,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:01,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 106 refuted. 0 times theorem prover too weak. 84 trivial. 14 not checked. [2018-12-02 12:49:01,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:49:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 32 [2018-12-02 12:49:01,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 12:49:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 12:49:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=935, Unknown=2, NotChecked=126, Total=1190 [2018-12-02 12:49:01,882 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 33 states. [2018-12-02 12:49:06,003 WARN L180 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-02 12:49:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:49:23,468 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2018-12-02 12:49:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 12:49:23,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-12-02 12:49:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:49:23,470 INFO L225 Difference]: With dead ends: 100 [2018-12-02 12:49:23,470 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 12:49:23,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=290, Invalid=2578, Unknown=2, NotChecked=210, Total=3080 [2018-12-02 12:49:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 12:49:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2018-12-02 12:49:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:49:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-12-02 12:49:23,474 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 76 [2018-12-02 12:49:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:49:23,474 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-12-02 12:49:23,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 12:49:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-12-02 12:49:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 12:49:23,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:23,475 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:23,475 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:49:23,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1460858383, now seen corresponding path program 7 times [2018-12-02 12:49:23,475 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:49:23,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:49:23,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:49:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:49:23,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:23,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:23,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:23,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:23,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:23,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:23,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:24,479 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:49:24,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:24,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:24,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:24,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:24,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:24,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:24,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:24,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:24,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:24,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:24,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:24,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:24,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:24,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:24,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:24,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:24,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:24,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:25,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:25,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:25,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2018-12-02 12:49:25,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:25,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:49:25,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:49:25,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:49:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:49:25,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:25,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:25,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12-02 12:49:25,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:25,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:25,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:25,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:25,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:25,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:25,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:25,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:25,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:25,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:25,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:25,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:27,112 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:49:27,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:27,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,146 INFO L478 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-12-02 12:49:27,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:27,160 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-12-02 12:49:27,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-02 12:49:27,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,293 INFO L478 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-12-02 12:49:27,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:27,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:27,344 INFO L478 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 24 treesize of output 36 [2018-12-02 12:49:27,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:27,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:27,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-12-02 12:49:28,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,269 INFO L478 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 31 treesize of output 55 [2018-12-02 12:49:28,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-12-02 12:49:28,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:28,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:63 [2018-12-02 12:49:28,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:28,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-12-02 12:49:28,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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-12-02 12:49:28,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:74, output treesize:14 [2018-12-02 12:49:28,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:28,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:28,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:28,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:28,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 82 trivial. 46 not checked. [2018-12-02 12:49:28,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:28,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:49:28,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 30 [2018-12-02 12:49:28,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 12:49:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 12:49:28,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=815, Unknown=2, NotChecked=118, Total=1056 [2018-12-02 12:49:28,943 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand 31 states. [2018-12-02 12:49:30,836 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:49:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:49:33,470 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2018-12-02 12:49:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 12:49:33,470 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2018-12-02 12:49:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:49:33,471 INFO L225 Difference]: With dead ends: 96 [2018-12-02 12:49:33,471 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 12:49:33,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=251, Invalid=2107, Unknown=2, NotChecked=190, Total=2550 [2018-12-02 12:49:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 12:49:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-12-02 12:49:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:49:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2018-12-02 12:49:33,474 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 85 [2018-12-02 12:49:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:49:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2018-12-02 12:49:33,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 12:49:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2018-12-02 12:49:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:49:33,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:33,475 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:33,475 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:49:33,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1877269318, now seen corresponding path program 8 times [2018-12-02 12:49:33,475 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:49:33,475 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:49:33,492 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 12:49:33,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:49:33,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:33,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:33,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:33,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:33,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:33,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:33,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:35,873 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:49:35,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:35,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:35,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:35,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:35,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:35,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:35,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:35,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:35,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:35,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:35,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:35,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12-02 12:49:36,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:36,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:36,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:36,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:49:36,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:36,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:36,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:36,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:36,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:36,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:36,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:36,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:36,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2018-12-02 12:49:36,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:37,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:49:37,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:49:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:49:37,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:49:37,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:37,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:37,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:37,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:37,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:37,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:37,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:37,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:38,284 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:49:38,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:38,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,315 INFO L478 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-12-02 12:49:38,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,329 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-12-02 12:49:38,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:49:38,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,468 INFO L478 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-12-02 12:49:38,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,492 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:38,492 INFO L478 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 23 treesize of output 42 [2018-12-02 12:49:38,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:38,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-12-02 12:49:38,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,697 INFO L478 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-12-02 12:49:38,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:38,733 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:38,734 INFO L478 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 30 treesize of output 55 [2018-12-02 12:49:38,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:38,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:38,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:61 [2018-12-02 12:49:39,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 12:49:39,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:39,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 84 [2018-12-02 12:49:39,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:39,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:80, output treesize:85 [2018-12-02 12:49:39,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-12-02 12:49:39,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:39,517 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:39,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 12:49:39,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:96, output treesize:14 [2018-12-02 12:49:39,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:39,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,597 INFO L478 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-12-02 12:49:39,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,611 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-12-02 12:49:39,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-12-02 12:49:39,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 12:49:39,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,758 INFO L478 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 14 treesize of output 17 [2018-12-02 12:49:39,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:14 [2018-12-02 12:49:39,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:39,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:39,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:39,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:39,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:39,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:39,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 104 trivial. 58 not checked. [2018-12-02 12:49:39,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:40,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:49:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 36 [2018-12-02 12:49:40,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 12:49:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 12:49:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1184, Unknown=2, NotChecked=142, Total=1482 [2018-12-02 12:49:40,198 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 37 states. [2018-12-02 12:49:42,314 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:49:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:49:49,298 INFO L93 Difference]: Finished difference Result 146 states and 193 transitions. [2018-12-02 12:49:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 12:49:49,298 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 94 [2018-12-02 12:49:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:49:49,299 INFO L225 Difference]: With dead ends: 146 [2018-12-02 12:49:49,299 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 12:49:49,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=329, Invalid=3217, Unknown=2, NotChecked=234, Total=3782 [2018-12-02 12:49:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 12:49:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2018-12-02 12:49:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-02 12:49:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2018-12-02 12:49:49,305 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 94 [2018-12-02 12:49:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:49:49,306 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2018-12-02 12:49:49,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 12:49:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2018-12-02 12:49:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:49:49,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:49,307 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:49,307 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:49:49,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1411818489, now seen corresponding path program 2 times [2018-12-02 12:49:49,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:49:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:49:49,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:49:49,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:49:49,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:49,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:49,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:49,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:49,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:49,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:49,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:49,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:50,438 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:49:50,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:50,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:50,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:50,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:50,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:50,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:50,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:50,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:50,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:50,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:49:50,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:50,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:49:50,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:50,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:50,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:50,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:50,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:50,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:50,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:50,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 108 trivial. 48 not checked. [2018-12-02 12:49:50,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:49:51,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/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-12-02 12:49:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:49:51,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:49:51,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:51,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:51,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:51,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:51,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:49:51,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:51,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:51,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:51,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:51,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:49:51,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:51,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:49:53,194 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:49:53,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:53,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,222 INFO L478 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-12-02 12:49:53,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,237 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-12-02 12:49:53,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:49:53,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,357 INFO L478 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-12-02 12:49:53,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:53,384 INFO L478 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 23 treesize of output 42 [2018-12-02 12:49:53,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 12:49:53,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-12-02 12:49:53,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,591 INFO L478 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-12-02 12:49:53,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:49:53,623 INFO L478 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 22 treesize of output 25 [2018-12-02 12:49:53,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:12 [2018-12-02 12:49:53,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:53,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:53,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:53,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:49:53,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:49:53,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:49:53,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:53,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:49:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 92 trivial. 64 not checked. [2018-12-02 12:49:53,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:49:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:49:54,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 28 [2018-12-02 12:49:54,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 12:49:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 12:49:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=709, Unknown=2, NotChecked=110, Total=930 [2018-12-02 12:49:54,055 INFO L87 Difference]: Start difference. First operand 139 states and 186 transitions. Second operand 29 states. [2018-12-02 12:49:56,160 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:49:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:49:59,174 INFO L93 Difference]: Finished difference Result 230 states and 309 transitions. [2018-12-02 12:49:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 12:49:59,175 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2018-12-02 12:49:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:49:59,176 INFO L225 Difference]: With dead ends: 230 [2018-12-02 12:49:59,176 INFO L226 Difference]: Without dead ends: 230 [2018-12-02 12:49:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=231, Invalid=1937, Unknown=2, NotChecked=182, Total=2352 [2018-12-02 12:49:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-02 12:49:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2018-12-02 12:49:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 12:49:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 200 transitions. [2018-12-02 12:49:59,183 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 200 transitions. Word has length 94 [2018-12-02 12:49:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:49:59,184 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 200 transitions. [2018-12-02 12:49:59,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 12:49:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 200 transitions. [2018-12-02 12:49:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:49:59,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:59,185 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:59,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:49:59,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 762387580, now seen corresponding path program 3 times [2018-12-02 12:49:59,185 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:49:59,185 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:49:59,201 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 12:49:59,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 12:49:59,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:49:59,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:49:59,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:59,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:59,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:49:59,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:49:59,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:49:59,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:50:00,697 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:50:00,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:00,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:00,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:00,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:00,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:00,723 INFO L478 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-12-02 12:50:00,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:00,737 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-12-02 12:50:00,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:50:01,734 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 12:50:01,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:01,741 INFO L478 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-12-02 12:50:01,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:01,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:01,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:01,763 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:50:01,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:50:01,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:01,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:01,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:18 [2018-12-02 12:50:03,556 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:50:03,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:03,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:03,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:03,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:03,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:03,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:03,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:03,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:03,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:50:03,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:03,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 12:50:03,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:50:03,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:50:03,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-12-02 12:50:04,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 34 [2018-12-02 12:50:04,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:50:04,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:04,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,260 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 2 xjuncts. [2018-12-02 12:50:04,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:38 [2018-12-02 12:50:04,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:04,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:04,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:50:04,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:04,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:04,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:50:04,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:04,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:50:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 29 proven. 225 refuted. 0 times theorem prover too weak. 44 trivial. 54 not checked. [2018-12-02 12:50:04,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:05,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:50:05,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:50:05,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:50:20,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 12:50:20,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:50:20,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:20,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:20,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:20,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:50:20,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,337 INFO L478 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-12-02 12:50:20,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:20,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,372 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-12-02 12:50:20,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:50:20,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,381 INFO L478 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-12-02 12:50:20,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,406 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:50:20,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2018-12-02 12:50:20,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 12:50:20,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:20,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:20,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:50:20,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:20,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:50:20,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:50:20,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:20,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:20,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:20,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:50:20,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:20,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:50:20,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:20,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:20,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:20,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:20,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:50:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 27 proven. 195 refuted. 0 times theorem prover too weak. 76 trivial. 54 not checked. [2018-12-02 12:50:20,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:21,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:50:21,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 36 [2018-12-02 12:50:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 12:50:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 12:50:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1209, Unknown=2, NotChecked=142, Total=1482 [2018-12-02 12:50:21,109 INFO L87 Difference]: Start difference. First operand 149 states and 200 transitions. Second operand 37 states. [2018-12-02 12:50:24,456 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-02 12:50:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:43,095 INFO L93 Difference]: Finished difference Result 221 states and 298 transitions. [2018-12-02 12:50:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 12:50:43,095 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 94 [2018-12-02 12:50:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:43,096 INFO L225 Difference]: With dead ends: 221 [2018-12-02 12:50:43,096 INFO L226 Difference]: Without dead ends: 221 [2018-12-02 12:50:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=275, Invalid=2923, Unknown=2, NotChecked=222, Total=3422 [2018-12-02 12:50:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-02 12:50:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 169. [2018-12-02 12:50:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 12:50:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions. [2018-12-02 12:50:43,102 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 94 [2018-12-02 12:50:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:43,102 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 228 transitions. [2018-12-02 12:50:43,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 12:50:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions. [2018-12-02 12:50:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:50:43,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:43,103 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:50:43,103 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:50:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1247716261, now seen corresponding path program 4 times [2018-12-02 12:50:43,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:50:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:50:43,116 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:50:43,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:50:43,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:50:43,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:43,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:43,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:43,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:43,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:43,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:43,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:50:44,296 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:50:44,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:44,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:44,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:44,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:44,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:44,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:44,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:50:44,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:44,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:50:44,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:44,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:44,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:44,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:44,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:45,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:45,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:45,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:45,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:45,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:45,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:45,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:45,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:45,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:45,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 108 trivial. 48 not checked. [2018-12-02 12:50:45,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:45,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:50:45,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:50:45,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:50:45,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:50:45,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:50:45,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:45,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:45,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:45,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:45,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:50:47,061 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:50:47,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,070 INFO L478 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-12-02 12:50:47,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:47,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,105 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-12-02 12:50:47,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:50:47,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,208 INFO L478 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-12-02 12:50:47,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,230 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:50:47,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2018-12-02 12:50:47,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 12:50:47,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:47,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:47,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:47,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:47,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:50:47,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:50:47,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,336 INFO L478 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-12-02 12:50:47,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:47,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,377 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-12-02 12:50:47,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:50:47,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:47,567 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:50:47,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:50:47,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,589 INFO L478 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-12-02 12:50:47,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:47,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-12-02 12:50:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 92 trivial. 64 not checked. [2018-12-02 12:50:47,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:47,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:50:47,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 27 [2018-12-02 12:50:47,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 12:50:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 12:50:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=659, Unknown=2, NotChecked=106, Total=870 [2018-12-02 12:50:47,906 INFO L87 Difference]: Start difference. First operand 169 states and 228 transitions. Second operand 28 states. [2018-12-02 12:50:49,850 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:50:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:52,513 INFO L93 Difference]: Finished difference Result 184 states and 246 transitions. [2018-12-02 12:50:52,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 12:50:52,513 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-12-02 12:50:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:52,514 INFO L225 Difference]: With dead ends: 184 [2018-12-02 12:50:52,514 INFO L226 Difference]: Without dead ends: 184 [2018-12-02 12:50:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=215, Invalid=1771, Unknown=2, NotChecked=174, Total=2162 [2018-12-02 12:50:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-02 12:50:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 72. [2018-12-02 12:50:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 12:50:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-12-02 12:50:52,519 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 94 [2018-12-02 12:50:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-12-02 12:50:52,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 12:50:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-12-02 12:50:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:50:52,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:52,520 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:50:52,520 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:50:52,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash -733273071, now seen corresponding path program 9 times [2018-12-02 12:50:52,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:50:52,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:50:52,539 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 12:50:53,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 12:50:53,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:50:53,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:53,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:53,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:53,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:50:53,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:53,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:53,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:50:54,399 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:50:54,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:54,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:54,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:54,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:54,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:54,429 INFO L478 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-12-02 12:50:54,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:54,442 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-12-02 12:50:54,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:50:55,477 WARN L180 SmtUtils]: Spent 965.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 12:50:55,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,485 INFO L478 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-12-02 12:50:55,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,508 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:50:55,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:50:55,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:18 [2018-12-02 12:50:55,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:55,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:55,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:55,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:55,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 12:50:56,626 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:50:56,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:56,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:56,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:50:56,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:56,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:50:56,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:56,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:56,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:56,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:56,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:56,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:56,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:56,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 12:50:56,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:50:56,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:50:56,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-12-02 12:50:57,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,138 INFO L478 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 2 case distinctions, treesize of input 27 treesize of output 32 [2018-12-02 12:50:57,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:50:57,188 INFO L478 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 22 treesize of output 19 [2018-12-02 12:50:57,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:57,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:50:57,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:44 [2018-12-02 12:50:57,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 56 [2018-12-02 12:50:57,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:50:57,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-02 12:50:57,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:57,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-12-02 12:50:57,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:57,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:57,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 12:50:57,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:57,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 12:50:57,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:57,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 12:50:57,894 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:66 [2018-12-02 12:50:58,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:58,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:58,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:58,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:58,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:58,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:58,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:50:58,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:50:58,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:50:58,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:50:58,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:50:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 18 proven. 272 refuted. 0 times theorem prover too weak. 78 trivial. 68 not checked. [2018-12-02 12:50:58,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:59,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:50:59,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:50:59,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:51:16,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 12:51:16,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:51:16,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:51:16,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:51:16,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:51:16,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:51:16,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,210 INFO L478 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-12-02 12:51:16,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:16,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,246 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-12-02 12:51:16,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:51:16,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,257 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:51:16,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 13 [2018-12-02 12:51:16,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,283 INFO L478 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 14 treesize of output 17 [2018-12-02 12:51:16,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 12:51:16,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:16,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:51:16,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:51:16,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:51:16,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:51:16,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:16,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:51:16,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:51:16,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:51:16,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:51:16,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:51:16,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:51:16,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:51:16,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:51:16,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:16,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:51:16,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:16,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:16,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:16,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:16,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:51:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 162 trivial. 38 not checked. [2018-12-02 12:51:16,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:51:19,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:51:19,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 29] total 43 [2018-12-02 12:51:19,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 12:51:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 12:51:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1750, Unknown=2, NotChecked=170, Total=2070 [2018-12-02 12:51:19,257 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 44 states. [2018-12-02 12:51:23,675 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-02 12:51:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:50,117 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2018-12-02 12:51:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 12:51:50,118 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 103 [2018-12-02 12:51:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:50,119 INFO L225 Difference]: With dead ends: 134 [2018-12-02 12:51:50,119 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 12:51:50,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=331, Invalid=4097, Unknown=2, NotChecked=262, Total=4692 [2018-12-02 12:51:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 12:51:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2018-12-02 12:51:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 12:51:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2018-12-02 12:51:50,122 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 103 [2018-12-02 12:51:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:50,122 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2018-12-02 12:51:50,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 12:51:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2018-12-02 12:51:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:51:50,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:50,123 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:50,123 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:51:50,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash 860694578, now seen corresponding path program 5 times [2018-12-02 12:51:50,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:51:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:51:50,142 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-02 12:51:50,820 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 12:51:50,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:51:50,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:51:50,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:51:50,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:50,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:50,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 12:51:50,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:51:50,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:50,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:50,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-02 12:51:50,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:50,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 12:51:50,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:51:50,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 12:51:50,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:47 [2018-12-02 12:51:52,113 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:51:52,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,123 INFO L478 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 40 treesize of output 44 [2018-12-02 12:51:52,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-02 12:51:52,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 treesize of output 71 [2018-12-02 12:51:52,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,361 INFO L478 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 51 treesize of output 63 [2018-12-02 12:51:52,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 12:51:52,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:93, output treesize:80 [2018-12-02 12:51:52,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 38 [2018-12-02 12:51:52,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,791 INFO L478 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 29 treesize of output 53 [2018-12-02 12:51:52,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:52,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 12:51:52,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:63, output treesize:63 [2018-12-02 12:51:52,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:52,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-02 12:51:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:53,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:53,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2018-12-02 12:51:53,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:53,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 12:51:53,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:78, output treesize:83 [2018-12-02 12:51:56,116 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:51:56,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:51:56,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-12-02 12:51:56,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:56,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 13 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-02 12:51:56,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:56,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 12:51:56,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:94, output treesize:17 [2018-12-02 12:51:56,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 36 [2018-12-02 12:51:56,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 12:51:56,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:51:56,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:56,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 12:51:56,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:34 [2018-12-02 12:51:56,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:56,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:51:56,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:57,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:57,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:51:57,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:51:57,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:51:57,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:51:57,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:51:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 20 proven. 248 refuted. 0 times theorem prover too weak. 90 trivial. 78 not checked. [2018-12-02 12:51:57,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:51:57,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:51:57,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:51:57,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 12:53:10,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 12:53:10,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:53:10,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:53:10,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:53:10,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:53:10,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:53:10,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:10,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:10,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:53:10,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:10,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:53:10,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:53:10,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:10,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:10,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:53:10,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:10,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:10,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:53:10,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:53:10,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:10,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:10,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:10,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:53:11,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:11,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:11,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:11,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:11,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:53:11,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:11,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:11,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:11,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:11,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:53:11,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:11,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:53:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 232 refuted. 0 times theorem prover too weak. 138 trivial. 56 not checked. [2018-12-02 12:53:11,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:53:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:53:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 24] total 47 [2018-12-02 12:53:11,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-02 12:53:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-02 12:53:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2068, Unknown=3, NotChecked=186, Total=2450 [2018-12-02 12:53:11,629 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand 48 states. [2018-12-02 12:53:15,161 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-02 12:53:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:53:21,736 INFO L93 Difference]: Finished difference Result 238 states and 318 transitions. [2018-12-02 12:53:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 12:53:21,736 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2018-12-02 12:53:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:53:21,737 INFO L225 Difference]: With dead ends: 238 [2018-12-02 12:53:21,737 INFO L226 Difference]: Without dead ends: 238 [2018-12-02 12:53:21,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=391, Invalid=4726, Unknown=3, NotChecked=282, Total=5402 [2018-12-02 12:53:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-02 12:53:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 169. [2018-12-02 12:53:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 12:53:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2018-12-02 12:53:21,742 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 103 [2018-12-02 12:53:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:53:21,742 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2018-12-02 12:53:21,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-02 12:53:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2018-12-02 12:53:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:53:21,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:53:21,743 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:53:21,743 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:53:21,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:53:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 900504338, now seen corresponding path program 6 times [2018-12-02 12:53:21,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:53:21,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:53:21,770 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-02 12:53:22,395 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-02 12:53:22,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:53:22,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:53:22,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:53:22,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:22,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:53:22,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:22,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:22,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:53:23,493 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 12:53:23,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:23,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:53:23,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:23,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:23,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:23,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:23,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:23,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:23,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-12-02 12:53:24,516 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:53:24,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:24,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:24,523 INFO L478 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-12-02 12:53:24,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:24,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:24,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:24,558 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-12-02 12:53:24,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:53:25,550 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:53:25,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:25,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:25,559 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:53:25,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:53:25,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,583 INFO L478 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 14 treesize of output 17 [2018-12-02 12:53:25,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 12:53:25,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:25,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:25,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:53:25,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:25,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:25,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:53:26,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:26,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:53:26,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:26,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:26,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:53:26,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:53:26,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:53:26,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:53:26,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:53:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 42 proven. 272 refuted. 0 times theorem prover too weak. 60 trivial. 62 not checked. [2018-12-02 12:53:26,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:53:26,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:53:26,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:53:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 12:54:19,929 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-02 12:54:19,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:54:19,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:54:19,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:19,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:19,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:19,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:19,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:19,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:54:19,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:19,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:19,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:19,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:19,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:19,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:19,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:20,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:20,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:20,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:20,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:20,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:54:20,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:54:20,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:20,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:20,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:20,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:20,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:54:20,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:20,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:20,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:54:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 30 proven. 266 refuted. 0 times theorem prover too weak. 80 trivial. 60 not checked. [2018-12-02 12:54:20,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:54:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:54:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 30 [2018-12-02 12:54:20,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 12:54:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 12:54:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=831, Unknown=2, NotChecked=118, Total=1056 [2018-12-02 12:54:20,616 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand 31 states. [2018-12-02 12:54:24,066 WARN L180 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-02 12:54:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:54:39,315 INFO L93 Difference]: Finished difference Result 252 states and 340 transitions. [2018-12-02 12:54:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 12:54:39,316 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2018-12-02 12:54:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:54:39,316 INFO L225 Difference]: With dead ends: 252 [2018-12-02 12:54:39,316 INFO L226 Difference]: Without dead ends: 252 [2018-12-02 12:54:39,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=221, Invalid=2137, Unknown=2, NotChecked=190, Total=2550 [2018-12-02 12:54:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-02 12:54:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2018-12-02 12:54:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 12:54:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2018-12-02 12:54:39,321 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 103 [2018-12-02 12:54:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:54:39,322 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2018-12-02 12:54:39,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 12:54:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2018-12-02 12:54:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:54:39,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:54:39,323 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:54:39,323 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:54:39,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:54:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1050359120, now seen corresponding path program 7 times [2018-12-02 12:54:39,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:54:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:54:39,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:54:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:54:39,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:54:39,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:39,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:39,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:39,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:39,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:39,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:54:40,707 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 12:54:40,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:40,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:40,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:40,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:54:40,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:54:40,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 12:54:40,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:40,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:40,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:40,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:40,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:41,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:54:41,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12-02 12:54:41,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:54:41,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:54:41,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:41,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:54:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 236 refuted. 0 times theorem prover too weak. 130 trivial. 60 not checked. [2018-12-02 12:54:41,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:54:41,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:54:41,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:54:41,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:54:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:54:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:54:41,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:41,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 12:54:41,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 12:54:41,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 12:54:41,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 12:54:41,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:41,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:41,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 12:54:41,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 12:54:41,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:41,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 12:54:41,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:41,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 12:54:42,844 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 12:54:42,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:42,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 12:54:42,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:42,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:42,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:42,872 INFO L478 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-12-02 12:54:42,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:42,887 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-12-02 12:54:42,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 12:54:43,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:43,044 INFO L478 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 12 treesize of output 15 [2018-12-02 12:54:43,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:43,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:43,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 12:54:43,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 12:54:43,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 12:54:43,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 12:54:43,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 12:54:43,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-12-02 12:54:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 236 refuted. 0 times theorem prover too weak. 122 trivial. 68 not checked. [2018-12-02 12:54:43,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:54:43,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:54:43,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 25 [2018-12-02 12:54:43,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 12:54:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 12:54:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=565, Unknown=2, NotChecked=98, Total=756 [2018-12-02 12:54:43,353 INFO L87 Difference]: Start difference. First operand 194 states and 262 transitions. Second operand 26 states. [2018-12-02 12:54:45,099 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 12:54:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:54:46,896 INFO L93 Difference]: Finished difference Result 213 states and 287 transitions. [2018-12-02 12:54:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:54:46,896 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-12-02 12:54:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:54:46,898 INFO L225 Difference]: With dead ends: 213 [2018-12-02 12:54:46,898 INFO L226 Difference]: Without dead ends: 213 [2018-12-02 12:54:46,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=190, Invalid=1538, Unknown=2, NotChecked=162, Total=1892 [2018-12-02 12:54:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-02 12:54:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 75. [2018-12-02 12:54:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 12:54:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2018-12-02 12:54:46,902 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 103 [2018-12-02 12:54:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:54:46,903 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2018-12-02 12:54:46,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 12:54:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2018-12-02 12:54:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 12:54:46,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:54:46,904 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:54:46,904 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION]=== [2018-12-02 12:54:46,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:54:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1398952575, now seen corresponding path program 3 times [2018-12-02 12:54:46,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 12:54:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ade271dc-ad96-4660-867a-68960b44c8f9/bin-2019/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 12:54:46,919 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 12:54:48,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 12:54:48,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 12:54:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:54:50,060 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:54:50,079 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 12:54:50,089 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 12:54:50,090 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 12:54:50,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:54:50 BoogieIcfgContainer [2018-12-02 12:54:50,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:54:50,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:54:50,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:54:50,106 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:54:50,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:30" (3/4) ... [2018-12-02 12:54:50,110 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:54:50,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:54:50,111 INFO L168 Benchmark]: Toolchain (without parser) took 439832.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 939.3 MB in the beginning and 924.0 MB in the end (delta: 15.4 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:54:50,111 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:54:50,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:54:50,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.12 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:54:50,111 INFO L168 Benchmark]: Boogie Preprocessor took 17.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:54:50,112 INFO L168 Benchmark]: RCFGBuilder took 176.23 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:54:50,112 INFO L168 Benchmark]: TraceAbstraction took 439272.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.4 MB). Free memory was 1.1 GB in the beginning and 924.0 MB in the end (delta: 165.8 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2018-12-02 12:54:50,112 INFO L168 Benchmark]: Witness Printer took 3.83 ms. Allocated memory is still 1.2 GB. Free memory is still 924.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:54:50,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.12 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.12 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 176.23 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 439272.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.4 MB). Free memory was 1.1 GB in the beginning and 924.0 MB in the end (delta: 165.8 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.83 ms. Allocated memory is still 1.2 GB. Free memory is still 924.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-2147221501:0}] [L1453] CALL entry_point() VAL [ldv_global_msg_list={-2147221501:0}] [L1439] int len = 10; VAL [ldv_global_msg_list={-2147221501:0}, len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={-2147221501:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={262659:0}, ldv_global_msg_list={-2147221501:0}, malloc(size)={262659:0}, size=40] [L1440] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={-2147221501:0}, ldv_malloc(sizeof(struct A18*)*len)={262659:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={262659:0}, i=0, ldv_global_msg_list={-2147221501:0}, len=10] [L1443] COND FALSE !(!array) VAL [array={262659:0}, i=0, ldv_global_msg_list={-2147221501:0}, len=10] [L1444] COND TRUE i