./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1_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_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-08 22:19:20,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:19:20,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:19:20,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:19:20,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:19:20,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:19:20,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:19:20,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:19:20,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:19:20,768 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:19:20,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:19:20,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:19:20,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:19:20,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:19:20,770 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:19:20,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:19:20,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:19:20,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:19:20,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:19:20,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:19:20,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:19:20,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:19:20,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:19:20,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:19:20,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:19:20,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:19:20,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:19:20,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:19:20,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:19:20,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:19:20,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:19:20,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:19:20,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:19:20,779 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:19:20,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:19:20,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:19:20,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 22:19:20,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:19:20,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:19:20,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:19:20,787 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:19:20,787 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 22:19:20,788 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 22:19:20,788 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 22:19:20,789 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 22:19:20,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:19:20,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:19:20,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:19:20,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:19:20,789 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:19:20,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:19:20,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:19:20,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:19:20,791 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 22:19:20,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:19:20,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:19:20,792 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_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-08 22:19:20,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:19:20,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:19:20,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:19:20,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:19:20,820 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:19:20,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:20,858 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/9a14a3435/f997d4f65ee9455a87d3b04360b22606/FLAG25dcfd683 [2018-12-08 22:19:21,323 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:19:21,323 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:21,330 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/9a14a3435/f997d4f65ee9455a87d3b04360b22606/FLAG25dcfd683 [2018-12-08 22:19:21,842 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/9a14a3435/f997d4f65ee9455a87d3b04360b22606 [2018-12-08 22:19:21,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:19:21,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:19:21,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:19:21,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:19:21,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:19:21,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:19:21" (1/1) ... [2018-12-08 22:19:21,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:21, skipping insertion in model container [2018-12-08 22:19:21,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:19:21" (1/1) ... [2018-12-08 22:19:21,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:19:21,876 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:19:22,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:19:22,022 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:19:22,086 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:19:22,107 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:19:22,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22 WrapperNode [2018-12-08 22:19:22,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:19:22,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:19:22,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:19:22,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:19:22,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:19:22,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:19:22,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:19:22,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:19:22,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... [2018-12-08 22:19:22,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:19:22,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:19:22,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:19:22,140 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:19:22,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:19:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:19:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:19:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 22:19:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 22:19:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-08 22:19:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-08 22:19:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:19:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-08 22:19:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-08 22:19:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:19:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:19:22,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:19:22,361 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 22:19:22,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:22 BoogieIcfgContainer [2018-12-08 22:19:22,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:19:22,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:19:22,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:19:22,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:19:22,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:19:21" (1/3) ... [2018-12-08 22:19:22,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebdbc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:19:22, skipping insertion in model container [2018-12-08 22:19:22,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:22" (2/3) ... [2018-12-08 22:19:22,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebdbc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:19:22, skipping insertion in model container [2018-12-08 22:19:22,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:22" (3/3) ... [2018-12-08 22:19:22,366 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:22,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:19:22,377 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-08 22:19:22,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-08 22:19:22,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:19:22,402 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 22:19:22,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:19:22,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:19:22,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:19:22,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:19:22,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:19:22,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:19:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 22:19:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:19:22,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:22,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:22,419 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:22,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 822613006, now seen corresponding path program 1 times [2018-12-08 22:19:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:22,541 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-08 22:19:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:22,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:22,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:22,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:22,554 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-08 22:19:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:22,657 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-08 22:19:22,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:22,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:19:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:22,663 INFO L225 Difference]: With dead ends: 66 [2018-12-08 22:19:22,663 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 22:19:22,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:19:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 22:19:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 22:19:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 22:19:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-08 22:19:22,686 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-08 22:19:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-08 22:19:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-08 22:19:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:19:22,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:22,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:22,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:22,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 822613007, now seen corresponding path program 1 times [2018-12-08 22:19:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:19:22,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:22,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:22,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:22,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:22,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:22,732 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-08 22:19:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:22,816 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-08 22:19:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:22,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:19:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:22,817 INFO L225 Difference]: With dead ends: 62 [2018-12-08 22:19:22,817 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 22:19:22,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:19:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 22:19:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-08 22:19:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 22:19:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-08 22:19:22,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-08 22:19:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:22,821 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-08 22:19:22,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-08 22:19:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:19:22,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:22,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:22,822 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:22,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash 257115824, now seen corresponding path program 1 times [2018-12-08 22:19:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:22,880 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-08 22:19:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:19:22,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:19:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:19:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:19:22,881 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 7 states. [2018-12-08 22:19:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:22,971 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:19:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:22,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-08 22:19:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:22,972 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:19:22,972 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:19:22,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:19:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:19:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 22:19:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 22:19:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-08 22:19:22,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-08 22:19:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:22,976 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-08 22:19:22,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:19:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-08 22:19:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:19:22,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:22,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:22,977 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:22,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2019797614, now seen corresponding path program 1 times [2018-12-08 22:19:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:22,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:23,015 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-08 22:19:23,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:23,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:23,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:23,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:23,017 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 5 states. [2018-12-08 22:19:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:23,083 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-08 22:19:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:19:23,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 22:19:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:23,083 INFO L225 Difference]: With dead ends: 58 [2018-12-08 22:19:23,083 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 22:19:23,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:19:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 22:19:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 22:19:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 22:19:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-08 22:19:23,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-08 22:19:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:23,086 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-08 22:19:23,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-08 22:19:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:19:23,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:23,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:23,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:23,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2019797613, now seen corresponding path program 1 times [2018-12-08 22:19:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:23,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:23,145 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-08 22:19:23,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:23,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:23,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:23,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:23,147 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 5 states. [2018-12-08 22:19:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:23,212 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-08 22:19:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:19:23,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 22:19:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:23,213 INFO L225 Difference]: With dead ends: 57 [2018-12-08 22:19:23,213 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 22:19:23,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:19:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 22:19:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 22:19:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 22:19:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-08 22:19:23,216 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-08 22:19:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:23,216 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-08 22:19:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-08 22:19:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:19:23,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:23,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:23,217 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:23,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 701093356, now seen corresponding path program 1 times [2018-12-08 22:19:23,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:23,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:23,320 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-08 22:19:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:23,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 22:19:23,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:23,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:19:23,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:19:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:19:23,321 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2018-12-08 22:19:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:23,489 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-08 22:19:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:19:23,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-08 22:19:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:23,489 INFO L225 Difference]: With dead ends: 56 [2018-12-08 22:19:23,490 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 22:19:23,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-08 22:19:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 22:19:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 22:19:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 22:19:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-08 22:19:23,492 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-08 22:19:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-08 22:19:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:19:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-08 22:19:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:19:23,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:23,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:23,493 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:23,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 701093357, now seen corresponding path program 1 times [2018-12-08 22:19:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:23,619 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-08 22:19:23,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:23,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 22:19:23,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:23,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 22:19:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 22:19:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:19:23,620 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 11 states. [2018-12-08 22:19:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:23,807 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-08 22:19:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:19:23,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-08 22:19:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:23,808 INFO L225 Difference]: With dead ends: 55 [2018-12-08 22:19:23,808 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 22:19:23,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-08 22:19:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 22:19:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 22:19:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 22:19:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-08 22:19:23,810 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-08 22:19:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:23,810 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-08 22:19:23,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 22:19:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-08 22:19:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:19:23,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:23,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:23,811 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:23,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1178455695, now seen corresponding path program 1 times [2018-12-08 22:19:23,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:23,857 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-08 22:19:23,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:23,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:19:23,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:23,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:19:23,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:19:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:19:23,858 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 8 states. [2018-12-08 22:19:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:23,927 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:19:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:19:23,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-08 22:19:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:23,928 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:19:23,928 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:19:23,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:19:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:19:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-08 22:19:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 22:19:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-08 22:19:23,932 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-08 22:19:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:23,932 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-08 22:19:23,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:19:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-08 22:19:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:19:23,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:23,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:23,933 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:23,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1178455696, now seen corresponding path program 1 times [2018-12-08 22:19:23,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:23,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:24,034 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-08 22:19:24,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:24,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:19:24,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:24,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:19:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:19:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:19:24,035 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 9 states. [2018-12-08 22:19:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:24,094 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-08 22:19:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:19:24,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-08 22:19:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:24,094 INFO L225 Difference]: With dead ends: 49 [2018-12-08 22:19:24,094 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 22:19:24,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:19:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 22:19:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-08 22:19:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 22:19:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 22:19:24,097 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-08 22:19:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:24,097 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-08 22:19:24,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:19:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 22:19:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:19:24,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:24,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:24,098 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:24,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1049212241, now seen corresponding path program 1 times [2018-12-08 22:19:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:24,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:24,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:24,298 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-08 22:19:24,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:24,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:24,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:24,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:24,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:24,300 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2018-12-08 22:19:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:24,754 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-08 22:19:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:19:24,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:19:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:24,756 INFO L225 Difference]: With dead ends: 50 [2018-12-08 22:19:24,756 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 22:19:24,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-08 22:19:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 22:19:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-08 22:19:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 22:19:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 22:19:24,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-08 22:19:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:24,759 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-08 22:19:24,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:19:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 22:19:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:19:24,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:24,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:24,759 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:24,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1049212242, now seen corresponding path program 1 times [2018-12-08 22:19:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:24,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:25,030 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-08 22:19:25,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:25,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:25,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:25,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:25,031 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-08 22:19:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:25,808 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-08 22:19:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:19:25,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:19:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:25,809 INFO L225 Difference]: With dead ends: 48 [2018-12-08 22:19:25,809 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 22:19:25,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-12-08 22:19:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 22:19:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-08 22:19:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 22:19:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 22:19:25,811 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-08 22:19:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:25,811 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-08 22:19:25,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:19:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 22:19:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:19:25,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:25,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:25,812 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:25,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1834158880, now seen corresponding path program 1 times [2018-12-08 22:19:25,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:25,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:25,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:25,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:25,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:26,130 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-08 22:19:26,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:26,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:26,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:26,131 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-08 22:19:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:26,691 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-08 22:19:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 22:19:26,692 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:19:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:26,692 INFO L225 Difference]: With dead ends: 46 [2018-12-08 22:19:26,692 INFO L226 Difference]: Without dead ends: 46 [2018-12-08 22:19:26,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2018-12-08 22:19:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-08 22:19:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-08 22:19:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 22:19:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-08 22:19:26,695 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 27 [2018-12-08 22:19:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:26,695 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-08 22:19:26,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:19:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-08 22:19:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:19:26,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:26,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:26,696 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:26,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1834158881, now seen corresponding path program 1 times [2018-12-08 22:19:26,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:26,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:26,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:19:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:26,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:26,965 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 17 states. [2018-12-08 22:19:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:27,706 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-08 22:19:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:19:27,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:19:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:27,707 INFO L225 Difference]: With dead ends: 45 [2018-12-08 22:19:27,707 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 22:19:27,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-12-08 22:19:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 22:19:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-08 22:19:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 22:19:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 22:19:27,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 27 [2018-12-08 22:19:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-08 22:19:27,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:19:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 22:19:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 22:19:27,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:27,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:27,711 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:27,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 352780760, now seen corresponding path program 1 times [2018-12-08 22:19:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:27,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:27,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:27,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:28,206 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-08 22:19:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:19:28,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:28,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:19:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:19:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:19:28,208 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-08 22:19:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:28,967 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:19:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 22:19:28,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-08 22:19:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:28,968 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:19:28,968 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:19:28,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2018-12-08 22:19:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:19:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-08 22:19:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 22:19:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 22:19:28,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-08 22:19:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:28,970 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-08 22:19:28,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:19:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 22:19:28,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 22:19:28,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:28,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:28,971 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:28,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:28,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1948698233, now seen corresponding path program 1 times [2018-12-08 22:19:28,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:28,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:28,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:29,307 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-08 22:19:29,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:29,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:19:29,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:19:29,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:19:29,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:19:29,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:19:29,308 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-08 22:19:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:29,863 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-08 22:19:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 22:19:29,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-08 22:19:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:29,864 INFO L225 Difference]: With dead ends: 43 [2018-12-08 22:19:29,864 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 22:19:29,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 22:19:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 22:19:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-08 22:19:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 22:19:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 22:19:29,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-08 22:19:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:29,866 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-08 22:19:29,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:19:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 22:19:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 22:19:29,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:29,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:29,867 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION]=== [2018-12-08 22:19:29,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash 301822444, now seen corresponding path program 1 times [2018-12-08 22:19:29,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:19:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:19:29,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:19:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:19:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:19:29,899 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:19:29,910 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 22:19:29,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:19:29 BoogieIcfgContainer [2018-12-08 22:19:29,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:19:29,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:19:29,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:19:29,922 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:19:29,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:22" (3/4) ... [2018-12-08 22:19:29,924 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:19:29,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:19:29,925 INFO L168 Benchmark]: Toolchain (without parser) took 8080.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 940.6 MB in the beginning and 887.1 MB in the end (delta: 53.5 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2018-12-08 22:19:29,926 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 970.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:19:29,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 22:19:29,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.12 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-08 22:19:29,927 INFO L168 Benchmark]: Boogie Preprocessor took 15.37 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-08 22:19:29,927 INFO L168 Benchmark]: RCFGBuilder took 220.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:19:29,928 INFO L168 Benchmark]: TraceAbstraction took 7559.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 887.1 MB in the end (delta: 158.3 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:19:29,928 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 887.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:19:29,930 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 970.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.12 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. * Boogie Preprocessor took 15.37 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. * RCFGBuilder took 220.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7559.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 887.1 MB in the end (delta: 158.3 MB). Peak memory consumption was 252.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 887.1 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.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={19:0}] [L643] CALL alloc_data(&data) VAL [pdata={19:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, pdata={19:0}, pdata={19:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->lo={10:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={10:0}, malloc(sizeof(int))={11:0}, pdata={19:0}, pdata={19:0}, pdata->hi={11:0}] [L643] RET alloc_data(&data) VAL [data={19:0}] [L644] CALL free_data(&data) VAL [data={19:0}] [L632] EXPR data->lo VAL [data={19:0}, data={19:0}, data->lo={10:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={19:0}, data={19:0}, data->hi={11:0}, lo={10:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L639] data->hi = ((void *)0) VAL [data={19:0}, data={19:0}, hi={11:0}, lo={10:0}] [L644] RET free_data(&data) VAL [data={19:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 7.5s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 499 SDtfs, 642 SDslu, 2099 SDs, 0 SdLazy, 3416 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 91333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 22:19:31,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:19:31,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:19:31,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:19:31,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:19:31,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:19:31,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:19:31,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:19:31,216 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:19:31,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:19:31,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:19:31,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:19:31,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:19:31,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:19:31,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:19:31,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:19:31,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:19:31,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:19:31,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:19:31,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:19:31,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:19:31,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:19:31,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:19:31,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:19:31,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:19:31,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:19:31,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:19:31,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:19:31,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:19:31,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:19:31,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:19:31,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:19:31,229 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:19:31,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:19:31,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:19:31,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:19:31,231 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-08 22:19:31,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:19:31,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:19:31,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:19:31,242 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:19:31,243 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 22:19:31,243 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 22:19:31,243 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 22:19:31,243 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 22:19:31,243 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 22:19:31,243 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 22:19:31,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:19:31,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:19:31,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:19:31,244 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:19:31,244 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 22:19:31,245 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 22:19:31,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:19:31,246 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 22:19:31,246 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 22:19:31,246 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:19:31,246 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:19:31,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:19:31,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:19:31,247 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 22:19:31,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:19:31,248 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 22:19:31,248 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_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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 -> 26e51b3bd14b76ecee3437e51ca1d0aadbe3cb6b [2018-12-08 22:19:31,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:19:31,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:19:31,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:19:31,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:19:31,281 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:19:31,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:31,316 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/48a3bfe41/3849805924d04e2889f7f60a43ee92fe/FLAG1254d34e2 [2018-12-08 22:19:31,744 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:19:31,744 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/sv-benchmarks/c/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:31,750 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/48a3bfe41/3849805924d04e2889f7f60a43ee92fe/FLAG1254d34e2 [2018-12-08 22:19:31,757 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/data/48a3bfe41/3849805924d04e2889f7f60a43ee92fe [2018-12-08 22:19:31,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:19:31,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:19:31,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:19:31,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:19:31,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:19:31,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:19:31" (1/1) ... [2018-12-08 22:19:31,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb0e1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:31, skipping insertion in model container [2018-12-08 22:19:31,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:19:31" (1/1) ... [2018-12-08 22:19:31,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:19:31,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:19:31,932 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:19:31,940 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:19:31,965 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:19:32,024 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:19:32,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32 WrapperNode [2018-12-08 22:19:32,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:19:32,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:19:32,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:19:32,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:19:32,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:19:32,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:19:32,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:19:32,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:19:32,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... [2018-12-08 22:19:32,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:19:32,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:19:32,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:19:32,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:19:32,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:19:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:19:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-08 22:19:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-08 22:19:32,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:19:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-08 22:19:32,096 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-08 22:19:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 22:19:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:19:32,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:19:32,348 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:19:32,348 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 22:19:32,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:32 BoogieIcfgContainer [2018-12-08 22:19:32,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:19:32,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:19:32,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:19:32,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:19:32,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:19:31" (1/3) ... [2018-12-08 22:19:32,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455ccf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:19:32, skipping insertion in model container [2018-12-08 22:19:32,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:19:32" (2/3) ... [2018-12-08 22:19:32,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455ccf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:19:32, skipping insertion in model container [2018-12-08 22:19:32,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:32" (3/3) ... [2018-12-08 22:19:32,353 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-12-08 22:19:32,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:19:32,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-08 22:19:32,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-08 22:19:32,387 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 22:19:32,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:19:32,388 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 22:19:32,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:19:32,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:19:32,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:19:32,388 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:19:32,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:19:32,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:19:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-12-08 22:19:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:19:32,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:32,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:32,403 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:32,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 822613006, now seen corresponding path program 1 times [2018-12-08 22:19:32,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:32,408 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:32,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:32,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:32,571 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-08 22:19:32,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 22:19:32,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:32,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:32,596 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-08 22:19:32,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,604 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-08 22:19:32,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-08 22:19:32,618 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-08 22:19:32,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:32,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:32,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:32,638 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 5 states. [2018-12-08 22:19:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:32,886 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-08 22:19:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:32,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:19:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:32,893 INFO L225 Difference]: With dead ends: 66 [2018-12-08 22:19:32,893 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 22:19:32,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:19:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 22:19:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 22:19:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 22:19:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-08 22:19:32,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 9 [2018-12-08 22:19:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:32,917 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-08 22:19:32,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-08 22:19:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 22:19:32,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:32,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:32,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:32,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash 822613007, now seen corresponding path program 1 times [2018-12-08 22:19:32,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:32,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:32,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:32,964 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-08 22:19:32,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,972 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-08 22:19:32,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:32,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 22:19:33,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,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, 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 21 [2018-12-08 22:19:33,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,016 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-08 22:19:33,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,029 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 1 xjuncts. [2018-12-08 22:19:33,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-12-08 22:19:33,041 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-08 22:19:33,041 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:33,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:33,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:19:33,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:19:33,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:19:33,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:19:33,044 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 5 states. [2018-12-08 22:19:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:33,309 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-08 22:19:33,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:33,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 22:19:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:33,310 INFO L225 Difference]: With dead ends: 62 [2018-12-08 22:19:33,310 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 22:19:33,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:19:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 22:19:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-08 22:19:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 22:19:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-08 22:19:33,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 9 [2018-12-08 22:19:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:33,315 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-08 22:19:33,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:19:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-08 22:19:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:19:33,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:33,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:33,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 257115824, now seen corresponding path program 1 times [2018-12-08 22:19:33,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:33,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:33,368 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-08 22:19:33,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,375 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-08 22:19:33,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 22:19:33,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,403 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-08 22:19:33,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,416 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 21 [2018-12-08 22:19:33,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,424 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 1 xjuncts. [2018-12-08 22:19:33,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-08 22:19:33,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,469 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-08 22:19:33,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,487 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 0 case distinctions, treesize of input 17 treesize of output 30 [2018-12-08 22:19:33,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:33,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2018-12-08 22:19:33,510 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-08 22:19:33,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:19:33,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:19:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:19:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:19:33,512 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 6 states. [2018-12-08 22:19:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:33,734 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:19:33,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:19:33,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-08 22:19:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:33,735 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:19:33,735 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:19:33,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:19:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:19:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-08 22:19:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 22:19:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-08 22:19:33,739 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 11 [2018-12-08 22:19:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:33,739 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-08 22:19:33,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:19:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-08 22:19:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:19:33,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:33,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:33,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:33,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2019797614, now seen corresponding path program 1 times [2018-12-08 22:19:33,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:33,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:33,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:33,811 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-08 22:19:33,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:19:33,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:33,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:33,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-12-08 22:19:33,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-12-08 22:19:33,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:38 [2018-12-08 22:19:33,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-08 22:19:33,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:33,913 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 25 treesize of output 34 [2018-12-08 22:19:33,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:33,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-12-08 22:19:33,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-12-08 22:19:33,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-12-08 22:19:33,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:33,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:33,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:33,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:27 [2018-12-08 22:19:34,017 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-08 22:19:34,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:34,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:19:34,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:19:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:19:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:19:34,019 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-12-08 22:19:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:34,396 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-08 22:19:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:19:34,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-08 22:19:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:34,397 INFO L225 Difference]: With dead ends: 58 [2018-12-08 22:19:34,397 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 22:19:34,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-08 22:19:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 22:19:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 22:19:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 22:19:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-08 22:19:34,400 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 13 [2018-12-08 22:19:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:34,401 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-08 22:19:34,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:19:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-08 22:19:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 22:19:34,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:34,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:34,402 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:34,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:34,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2019797613, now seen corresponding path program 1 times [2018-12-08 22:19:34,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:34,402 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:19:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:34,478 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-08 22:19:34,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,487 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-08 22:19:34,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-08 22:19:34,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:34,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:34,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:34,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:34,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-12-08 22:19:34,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:34,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:34,566 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 17 treesize of output 8 [2018-12-08 22:19:34,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,580 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 16 treesize of output 23 [2018-12-08 22:19:34,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2018-12-08 22:19:34,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-08 22:19:34,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:34,623 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 16 treesize of output 23 [2018-12-08 22:19:34,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-08 22:19:34,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:34,671 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 24 treesize of output 33 [2018-12-08 22:19:34,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2018-12-08 22:19:34,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:19:34,789 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 11 treesize of output 3 [2018-12-08 22:19:34,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:34,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-12-08 22:19:34,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-12-08 22:19:34,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:34,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:34,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:34,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2018-12-08 22:19:34,851 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-08 22:19:34,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:34,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:34,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 22:19:34,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 22:19:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 22:19:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:19:34,854 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 9 states. [2018-12-08 22:19:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:35,400 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-08 22:19:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 22:19:35,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-08 22:19:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:35,401 INFO L225 Difference]: With dead ends: 57 [2018-12-08 22:19:35,402 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 22:19:35,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-08 22:19:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 22:19:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 22:19:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 22:19:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-08 22:19:35,405 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 13 [2018-12-08 22:19:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:35,405 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-08 22:19:35,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 22:19:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-08 22:19:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:19:35,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:35,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:35,406 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:35,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:35,406 INFO L82 PathProgramCache]: Analyzing trace with hash 701093356, now seen corresponding path program 1 times [2018-12-08 22:19:35,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:35,406 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:35,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:35,493 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-08 22:19:35,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:19:35,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:35,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:35,513 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-08 22:19:35,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 22:19:35,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:35,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:35,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-08 22:19:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 22:19:35,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2018-12-08 22:19:35,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-12-08 22:19:35,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-12-08 22:19:35,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-08 22:19:35,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-08 22:19:35,648 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 20 treesize of output 1 [2018-12-08 22:19:35,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2018-12-08 22:19:35,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 22:19:35,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 22:19:35,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:35,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:35,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-12-08 22:19:35,688 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-08 22:19:35,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:35,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:35,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:19:35,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:19:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:19:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:19:35,691 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 10 states. [2018-12-08 22:19:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:36,108 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-08 22:19:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:19:36,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-08 22:19:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:36,108 INFO L225 Difference]: With dead ends: 56 [2018-12-08 22:19:36,108 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 22:19:36,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 22:19:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 22:19:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 22:19:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-08 22:19:36,111 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 16 [2018-12-08 22:19:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:36,111 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-08 22:19:36,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:19:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-08 22:19:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 22:19:36,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:36,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:36,112 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:36,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash 701093357, now seen corresponding path program 1 times [2018-12-08 22:19:36,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:36,112 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:19:36,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:36,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:36,201 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-08 22:19:36,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:19:36,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:36,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:36,216 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-08 22:19:36,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 22:19:36,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:36,232 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:36,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-08 22:19:36,257 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-08 22:19:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 22:19:36,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-12-08 22:19:36,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:36,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 17 treesize of output 24 [2018-12-08 22:19:36,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 22:19:36,323 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 10 treesize of output 9 [2018-12-08 22:19:36,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-12-08 22:19:36,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-08 22:19:36,408 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 20 treesize of output 1 [2018-12-08 22:19:36,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-08 22:19:36,450 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 20 treesize of output 1 [2018-12-08 22:19:36,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:32 [2018-12-08 22:19:36,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:19:36,467 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 11 treesize of output 3 [2018-12-08 22:19:36,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 22:19:36,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 22:19:36,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:36,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-12-08 22:19:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:19:36,502 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:36,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:19:36,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:19:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:19:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:19:36,504 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 10 states. [2018-12-08 22:19:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:37,018 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-08 22:19:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:19:37,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-08 22:19:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:37,019 INFO L225 Difference]: With dead ends: 55 [2018-12-08 22:19:37,019 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 22:19:37,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 22:19:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 22:19:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 22:19:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-08 22:19:37,022 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 16 [2018-12-08 22:19:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:37,022 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-08 22:19:37,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:19:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-08 22:19:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:19:37,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:37,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:37,023 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1178455695, now seen corresponding path program 1 times [2018-12-08 22:19:37,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:37,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:37,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:37,086 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 5 treesize of output 1 [2018-12-08 22:19:37,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:37,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:37,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-12-08 22:19:37,105 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-08 22:19:37,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:37,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:37,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:19:37,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:19:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:19:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:19:37,107 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 7 states. [2018-12-08 22:19:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:37,356 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-08 22:19:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:19:37,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-08 22:19:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:37,357 INFO L225 Difference]: With dead ends: 59 [2018-12-08 22:19:37,357 INFO L226 Difference]: Without dead ends: 59 [2018-12-08 22:19:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:19:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-08 22:19:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-12-08 22:19:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 22:19:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-08 22:19:37,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 22 [2018-12-08 22:19:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:37,360 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-08 22:19:37,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:19:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-08 22:19:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:19:37,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:37,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:37,361 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1178455696, now seen corresponding path program 1 times [2018-12-08 22:19:37,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:37,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:37,503 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-08 22:19:37,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:19:37,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 22:19:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 22:19:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:19:37,505 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 8 states. [2018-12-08 22:19:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:37,850 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-08 22:19:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:19:37,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-08 22:19:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:37,851 INFO L225 Difference]: With dead ends: 49 [2018-12-08 22:19:37,851 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 22:19:37,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:19:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 22:19:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-08 22:19:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 22:19:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-08 22:19:37,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 22 [2018-12-08 22:19:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:37,853 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-08 22:19:37,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 22:19:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-08 22:19:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:19:37,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:37,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:37,854 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:37,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1049212241, now seen corresponding path program 1 times [2018-12-08 22:19:37,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:19:37,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:37,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:37,963 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-08 22:19:37,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:37,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:37,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:19:37,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:37,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:37,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:37,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:19:38,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:38,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:38,023 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-08 22:19:38,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:19:38,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-08 22:19:38,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:38,058 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 18 treesize of output 25 [2018-12-08 22:19:38,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-08 22:19:38,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 62 [2018-12-08 22:19:38,217 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 62 treesize of output 42 [2018-12-08 22:19:38,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,298 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 57 [2018-12-08 22:19:38,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 22:19:38,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:19:38,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:19:38,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:89 [2018-12-08 22:19:38,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-08 22:19:38,558 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 24 treesize of output 1 [2018-12-08 22:19:38,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-12-08 22:19:38,680 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 24 treesize of output 1 [2018-12-08 22:19:38,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2018-12-08 22:19:38,782 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 52 treesize of output 28 [2018-12-08 22:19:38,782 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:38,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:38,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2018-12-08 22:19:38,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:19:38,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:19:38,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 22:19:38,989 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:168, output treesize:80 [2018-12-08 22:19:39,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:39,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:39,082 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 39 treesize of output 31 [2018-12-08 22:19:39,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:39,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:39,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-12-08 22:19:39,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 22:19:39,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-08 22:19:39,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:39,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:39,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:39,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2018-12-08 22:19:39,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-08 22:19:39,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:39,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:39,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:39,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:39,279 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 17 states. [2018-12-08 22:19:40,134 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-12-08 22:19:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:19:41,013 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-08 22:19:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:19:41,013 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:19:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:19:41,015 INFO L225 Difference]: With dead ends: 50 [2018-12-08 22:19:41,015 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 22:19:41,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-08 22:19:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 22:19:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-12-08 22:19:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 22:19:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-08 22:19:41,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 26 [2018-12-08 22:19:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:19:41,018 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-08 22:19:41,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:19:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-08 22:19:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 22:19:41,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:19:41,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:19:41,018 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:19:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:19:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1049212242, now seen corresponding path program 1 times [2018-12-08 22:19:41,019 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:19:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:19:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:19:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:19:41,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:19:41,146 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-08 22:19:41,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:19:41,163 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-08 22:19:41,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-12-08 22:19:41,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:41,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:41,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:19:41,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:19:41,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:47 [2018-12-08 22:19:41,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,280 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 16 treesize of output 23 [2018-12-08 22:19:41,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2018-12-08 22:19:41,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 22:19:41,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,346 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 16 treesize of output 23 [2018-12-08 22:19:41,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-12-08 22:19:41,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2018-12-08 22:19:41,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:73 [2018-12-08 22:19:41,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 86 [2018-12-08 22:19:41,613 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 79 treesize of output 51 [2018-12-08 22:19:41,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,711 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 2 case distinctions, treesize of input 68 treesize of output 50 [2018-12-08 22:19:41,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 22:19:41,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:19:41,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 80 [2018-12-08 22:19:41,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:41,859 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 74 treesize of output 69 [2018-12-08 22:19:41,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:41,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 104 [2018-12-08 22:19:41,937 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 106 treesize of output 78 [2018-12-08 22:19:41,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:42,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:42,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:42,052 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 93 [2018-12-08 22:19:42,053 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:19:42,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:19:42,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:19:42,202 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:172 [2018-12-08 22:19:42,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 112 [2018-12-08 22:19:42,513 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 114 treesize of output 90 [2018-12-08 22:19:42,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:42,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:42,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 97 [2018-12-08 22:19:42,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 22:19:42,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:19:45,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:45,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 139 [2018-12-08 22:19:45,626 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 24 treesize of output 1 [2018-12-08 22:19:45,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:45,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:47,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2018-12-08 22:19:47,133 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 24 treesize of output 1 [2018-12-08 22:19:47,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:47,153 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:47,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-12-08 22:19:47,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:47,996 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 25 treesize of output 34 [2018-12-08 22:19:47,996 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 96 [2018-12-08 22:19:48,060 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 81 treesize of output 57 [2018-12-08 22:19:48,060 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,151 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 2 case distinctions, treesize of input 76 treesize of output 64 [2018-12-08 22:19:48,151 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 22:19:48,196 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:19:48,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-12-08 22:19:48,209 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 25 treesize of output 20 [2018-12-08 22:19:48,210 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,223 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:48,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 103 [2018-12-08 22:19:48,462 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 24 treesize of output 1 [2018-12-08 22:19:48,463 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,481 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:48,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-12-08 22:19:48,634 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 24 treesize of output 1 [2018-12-08 22:19:48,634 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,643 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:48,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:19:48,714 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:354, output treesize:194 [2018-12-08 22:19:49,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:49,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:49,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:19:49,223 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 28 treesize of output 33 [2018-12-08 22:19:49,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:49,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:49,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:229, output treesize:67 [2018-12-08 22:19:49,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 22:19:49,410 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 11 treesize of output 3 [2018-12-08 22:19:49,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:19:49,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:19:49,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-12-08 22:19:49,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-12-08 22:19:49,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:49,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:49,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:19:49,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:18 [2018-12-08 22:19:49,547 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-08 22:19:49,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:19:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:19:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:19:49,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:19:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:19:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:19:49,550 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-12-08 22:20:04,791 WARN L180 SmtUtils]: Spent 12.41 s on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-12-08 22:20:05,889 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-08 22:20:06,548 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-12-08 22:20:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:20:06,721 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-08 22:20:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 22:20:06,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-12-08 22:20:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:20:06,722 INFO L225 Difference]: With dead ends: 48 [2018-12-08 22:20:06,722 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 22:20:06,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2018-12-08 22:20:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 22:20:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-08 22:20:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 22:20:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-08 22:20:06,724 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2018-12-08 22:20:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:20:06,724 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-08 22:20:06,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:20:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-08 22:20:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:20:06,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:20:06,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:20:06,725 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:20:06,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:20:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1834158880, now seen corresponding path program 1 times [2018-12-08 22:20:06,725 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:20:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:20:06,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:20:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:20:06,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:20:06,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-08 22:20:06,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:20:06,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:20:06,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:20:06,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:20:06,913 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-08 22:20:06,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:06,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:06,928 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-08 22:20:06,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:25 [2018-12-08 22:20:06,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-08 22:20:06,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:06,967 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 18 treesize of output 25 [2018-12-08 22:20:06,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:06,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:37 [2018-12-08 22:20:07,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 64 [2018-12-08 22:20:07,106 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 62 treesize of output 42 [2018-12-08 22:20:07,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:07,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:07,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:07,186 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 4 case distinctions, treesize of input 44 treesize of output 51 [2018-12-08 22:20:07,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:20:07,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:20:07,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:20:07,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:64, output treesize:99 [2018-12-08 22:20:07,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 153 [2018-12-08 22:20:07,495 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 36 treesize of output 1 [2018-12-08 22:20:07,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:07,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:08,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 111 [2018-12-08 22:20:08,812 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 36 treesize of output 1 [2018-12-08 22:20:08,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:08,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:09,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 154 [2018-12-08 22:20:09,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:09,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 125 [2018-12-08 22:20:09,545 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:09,959 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 148 treesize of output 112 [2018-12-08 22:20:09,959 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:10,174 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:11,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2018-12-08 22:20:11,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:11,433 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 59 treesize of output 78 [2018-12-08 22:20:11,433 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:11,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:11,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2018-12-08 22:20:11,517 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 113 treesize of output 77 [2018-12-08 22:20:11,517 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 99 [2018-12-08 22:20:11,728 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 22:20:11,815 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:20:11,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2018-12-08 22:20:11,830 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 61 treesize of output 20 [2018-12-08 22:20:11,831 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:11,857 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:12,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 167 [2018-12-08 22:20:12,332 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 36 treesize of output 1 [2018-12-08 22:20:12,333 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:12,367 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:12,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 115 [2018-12-08 22:20:12,592 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 36 treesize of output 1 [2018-12-08 22:20:12,592 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:12,615 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:12,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-08 22:20:12,770 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:486, output treesize:329 [2018-12-08 22:20:13,036 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 22:20:13,042 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 22:20:13,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:13,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:13,150 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 17 treesize of output 8 [2018-12-08 22:20:13,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:379, output treesize:78 [2018-12-08 22:20:13,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-12-08 22:20:13,535 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 33 treesize of output 20 [2018-12-08 22:20:13,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-08 22:20:13,572 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-12-08 22:20:13,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:13,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:21 [2018-12-08 22:20:13,766 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-08 22:20:13,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:20:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:20:13,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:20:13,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:20:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:20:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:20:13,769 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 17 states. [2018-12-08 22:20:14,624 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-08 22:20:22,675 WARN L180 SmtUtils]: Spent 7.96 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-08 22:20:23,098 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-08 22:20:23,714 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 22:20:23,964 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 22:20:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:20:24,770 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-08 22:20:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 22:20:24,771 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:20:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:20:24,771 INFO L225 Difference]: With dead ends: 46 [2018-12-08 22:20:24,771 INFO L226 Difference]: Without dead ends: 46 [2018-12-08 22:20:24,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2018-12-08 22:20:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-08 22:20:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-08 22:20:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 22:20:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-08 22:20:24,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 27 [2018-12-08 22:20:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:20:24,774 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-08 22:20:24,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:20:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-08 22:20:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 22:20:24,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:20:24,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:20:24,775 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:20:24,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:20:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1834158881, now seen corresponding path program 1 times [2018-12-08 22:20:24,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:20:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:20:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:20:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:20:24,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:20:24,900 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-08 22:20:24,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:20:24,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:20:24,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:20:24,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:20:24,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:24,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:24,956 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-08 22:20:24,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:24,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:20:24,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-08 22:20:24,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:24,995 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 18 treesize of output 25 [2018-12-08 22:20:24,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-12-08 22:20:25,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 55 [2018-12-08 22:20:25,135 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 51 treesize of output 31 [2018-12-08 22:20:25,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,201 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 52 [2018-12-08 22:20:25,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:25,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:25,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:25,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:68 [2018-12-08 22:20:25,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 60 [2018-12-08 22:20:25,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:25,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 45 [2018-12-08 22:20:25,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:25,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 48 treesize of output 24 [2018-12-08 22:20:25,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:25,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-12-08 22:20:25,792 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 24 treesize of output 1 [2018-12-08 22:20:25,792 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-12-08 22:20:25,897 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 24 treesize of output 1 [2018-12-08 22:20:25,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,905 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:25,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 22:20:25,959 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:184, output treesize:127 [2018-12-08 22:20:26,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:26,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:26,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-12-08 22:20:26,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:26,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:26,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:97, output treesize:33 [2018-12-08 22:20:26,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-08 22:20:26,255 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-12-08 22:20:26,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:26,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:26,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:26,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2018-12-08 22:20:26,323 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-08 22:20:26,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:20:26,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:20:26,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 22:20:26,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 22:20:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 22:20:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-08 22:20:26,326 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 17 states. [2018-12-08 22:20:27,211 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-08 22:20:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:20:27,970 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-08 22:20:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:20:27,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-08 22:20:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:20:27,971 INFO L225 Difference]: With dead ends: 45 [2018-12-08 22:20:27,971 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 22:20:27,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-12-08 22:20:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 22:20:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-08 22:20:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 22:20:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-08 22:20:27,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 27 [2018-12-08 22:20:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:20:27,974 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-08 22:20:27,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 22:20:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-08 22:20:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 22:20:27,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:20:27,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:20:27,975 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:20:27,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:20:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 352780760, now seen corresponding path program 1 times [2018-12-08 22:20:27,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:20:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:20:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:20:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:20:28,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:20:28,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-08 22:20:28,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:20:28,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:20:28,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:20:28,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-12-08 22:20:28,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-12-08 22:20:28,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:28,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:28,240 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 38 treesize of output 57 [2018-12-08 22:20:28,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-12-08 22:20:28,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 70 [2018-12-08 22:20:28,396 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 68 treesize of output 48 [2018-12-08 22:20:28,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:28,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:28,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:28,473 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 50 [2018-12-08 22:20:28,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:20:28,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:20:28,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 22:20:28,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:100 [2018-12-08 22:20:30,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:30,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 77 [2018-12-08 22:20:30,468 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 24 treesize of output 1 [2018-12-08 22:20:30,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:30,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:30,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:30,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2018-12-08 22:20:30,587 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 24 treesize of output 1 [2018-12-08 22:20:30,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:30,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:30,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2018-12-08 22:20:30,681 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 55 treesize of output 31 [2018-12-08 22:20:30,681 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:30,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:30,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 46 [2018-12-08 22:20:30,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:30,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:20:30,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 22:20:30,843 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:181, output treesize:105 [2018-12-08 22:20:31,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:31,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:31,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:31,231 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 26 treesize of output 33 [2018-12-08 22:20:31,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:133, output treesize:36 [2018-12-08 22:20:31,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-12-08 22:20:31,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-12-08 22:20:31,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-12-08 22:20:31,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:31,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, 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 21 [2018-12-08 22:20:31,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:31,569 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-08 22:20:31,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 22:20:31,611 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-08 22:20:31,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:20:31,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:20:31,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:20:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:20:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:20:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:20:31,614 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2018-12-08 22:20:42,266 WARN L180 SmtUtils]: Spent 9.84 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-08 22:20:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:20:43,496 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:20:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 22:20:43,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-12-08 22:20:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:20:43,497 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:20:43,497 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:20:43,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 22:20:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:20:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-12-08 22:20:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 22:20:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-08 22:20:43,499 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-12-08 22:20:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:20:43,499 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-08 22:20:43,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:20:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-08 22:20:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 22:20:43,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:20:43,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:20:43,500 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:20:43,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:20:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1948698233, now seen corresponding path program 1 times [2018-12-08 22:20:43,501 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:20:43,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/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-08 22:20:43,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:20:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:20:43,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:20:43,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-08 22:20:43,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:20:43,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:20:43,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:20:43,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 22:20:43,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:43,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:43,724 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-08 22:20:43,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2018-12-08 22:20:43,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-08 22:20:43,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:43,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 22:20:43,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:43,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-08 22:20:43,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-12-08 22:20:43,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:43,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:43,920 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 4 case distinctions, treesize of input 35 treesize of output 46 [2018-12-08 22:20:43,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:44,011 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 40 treesize of output 20 [2018-12-08 22:20:44,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:44,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:20:44,076 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:60, output treesize:89 [2018-12-08 22:20:44,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-08 22:20:44,206 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 24 treesize of output 1 [2018-12-08 22:20:44,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-08 22:20:44,323 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 24 treesize of output 1 [2018-12-08 22:20:44,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2018-12-08 22:20:44,413 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 52 treesize of output 28 [2018-12-08 22:20:44,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:44,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 53 [2018-12-08 22:20:44,487 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 22:20:44,519 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:20:44,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 22:20:44,575 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:164, output treesize:76 [2018-12-08 22:20:44,651 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 22:20:44,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:44,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:44,668 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 17 treesize of output 8 [2018-12-08 22:20:44,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:27 [2018-12-08 22:20:44,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-08 22:20:44,864 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 23 treesize of output 9 [2018-12-08 22:20:44,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-12-08 22:20:44,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:20:44,942 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 23 [2018-12-08 22:20:44,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,948 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-08 22:20:44,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-12-08 22:20:44,990 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 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 22:20:44,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:20:44,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:20:44,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-12-08 22:20:45,040 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-08 22:20:45,040 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 22:20:45,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:20:45,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-08 22:20:45,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:20:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:20:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-12-08 22:20:45,043 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-12-08 22:20:45,918 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-08 22:20:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:20:47,053 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-08 22:20:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 22:20:47,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-08 22:20:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:20:47,054 INFO L225 Difference]: With dead ends: 44 [2018-12-08 22:20:47,054 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 22:20:47,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 22:20:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 22:20:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-12-08 22:20:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 22:20:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-08 22:20:47,055 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 33 [2018-12-08 22:20:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:20:47,056 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-08 22:20:47,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:20:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-08 22:20:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 22:20:47,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:20:47,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:20:47,056 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr14REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr12REQUIRES_VIOLATION]=== [2018-12-08 22:20:47,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:20:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash 301822444, now seen corresponding path program 1 times [2018-12-08 22:20:47,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 22:20:47,057 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b80b84d-5168-4469-b9bf-d4f84a87bd51/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 22:20:47,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:20:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:20:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:20:47,555 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:20:47,568 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 22:20:47,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:20:47 BoogieIcfgContainer [2018-12-08 22:20:47,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:20:47,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:20:47,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:20:47,581 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:20:47,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:19:32" (3/4) ... [2018-12-08 22:20:47,584 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 22:20:47,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:20:47,584 INFO L168 Benchmark]: Toolchain (without parser) took 75825.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:20:47,584 INFO L168 Benchmark]: CDTParser took 0.13 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-08 22:20:47,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-12-08 22:20:47,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:20:47,585 INFO L168 Benchmark]: Boogie Preprocessor took 18.90 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-08 22:20:47,585 INFO L168 Benchmark]: RCFGBuilder took 285.21 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:20:47,585 INFO L168 Benchmark]: TraceAbstraction took 75231.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 209.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:20:47,585 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:20:47,587 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.05 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.90 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 285.21 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75231.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 209.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] TData data; VAL [data={-1073740797:0}] [L643] CALL alloc_data(&data) VAL [pdata={-1073740797:0}] [L625] pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1073740799:0}, pdata={-1073740797:0}, pdata={-1073740797:0}] [L626] pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={-1073740799:0}, malloc(sizeof(int))={-1073740798:0}, pdata={-1073740797:0}, pdata={-1073740797:0}] [L627] EXPR pdata->lo VAL [malloc(sizeof(int))={-1073740799:0}, malloc(sizeof(int))={-1073740798:0}, pdata={-1073740797:0}, pdata={-1073740797:0}, pdata->lo={-1073740799:0}] [L627] *(pdata->lo) = 4 VAL [malloc(sizeof(int))={-1073740799:0}, malloc(sizeof(int))={-1073740798:0}, pdata={-1073740797:0}, pdata={-1073740797:0}, pdata->lo={-1073740799:0}] [L628] EXPR pdata->hi VAL [malloc(sizeof(int))={-1073740799:0}, malloc(sizeof(int))={-1073740798:0}, pdata={-1073740797:0}, pdata={-1073740797:0}, pdata->hi={-1073740798:0}] [L628] *(pdata->hi) = 8 VAL [malloc(sizeof(int))={-1073740799:0}, malloc(sizeof(int))={-1073740798:0}, pdata={-1073740797:0}, pdata={-1073740797:0}, pdata->hi={-1073740798:0}] [L643] RET alloc_data(&data) VAL [data={-1073740797:0}] [L644] CALL free_data(&data) VAL [data={-1073740797:0}] [L632] EXPR data->lo VAL [data={-1073740797:0}, data={-1073740797:0}, data->lo={-1073740799:0}] [L632] int *lo = data->lo; [L633] EXPR data->hi VAL [data={-1073740797:0}, data={-1073740797:0}, data->hi={-1073740798:0}, lo={-1073740799:0}] [L633] int *hi = data->hi; [L634] EXPR \read(*lo) VAL [\read(*lo)=4, data={-1073740797:0}, data={-1073740797:0}, hi={-1073740798:0}, lo={-1073740799:0}] [L634] EXPR \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={-1073740797:0}, data={-1073740797:0}, hi={-1073740798:0}, lo={-1073740799:0}] [L634] COND FALSE !(*lo >= *hi) [L638] data->lo = ((void *)0) VAL [data={-1073740797:0}, data={-1073740797:0}, hi={-1073740798:0}, lo={-1073740799:0}] [L639] data->hi = ((void *)0) VAL [data={-1073740797:0}, data={-1073740797:0}, hi={-1073740798:0}, lo={-1073740799:0}] [L644] RET free_data(&data) VAL [data={-1073740797:0}] [L645] return 0; [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 70 locations, 29 error locations. UNSAFE Result, 75.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 48.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 494 SDtfs, 632 SDslu, 2092 SDs, 0 SdLazy, 3238 SolverSat, 214 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 287 ConstructedInterpolants, 34 QuantifiedInterpolants, 203059 SizeOfPredicates, 154 NumberOfNonLiveVariables, 1517 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...