./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.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_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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 708e975f6ded0cfba15d7fd51cdde51c174d1f46 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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 708e975f6ded0cfba15d7fd51cdde51c174d1f46 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:03:41,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:03:41,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:03:41,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:03:41,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:03:41,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:03:41,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:03:41,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:03:41,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:03:41,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:03:41,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:03:41,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:03:41,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:03:41,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:03:41,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:03:41,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:03:41,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:03:41,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:03:41,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:03:41,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:03:41,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:03:41,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:03:41,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:03:41,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:03:41,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:03:41,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:03:41,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:03:41,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:03:41,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:03:41,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:03:41,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:03:41,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:03:41,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:03:41,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:03:41,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:03:41,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:03:41,291 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:03:41,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:03:41,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:03:41,299 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:03:41,299 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:03:41,299 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:03:41,299 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:03:41,299 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:03:41,299 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:03:41,300 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:03:41,300 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:03:41,300 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:03:41,300 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:03:41,300 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:03:41,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:03:41,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:03:41,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:03:41,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:03:41,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:03:41,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:03:41,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:03:41,303 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_683eafb2-7492-41b6-8976-684f0b81a00a/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 -> 708e975f6ded0cfba15d7fd51cdde51c174d1f46 [2018-12-09 19:03:41,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:03:41,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:03:41,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:03:41,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:03:41,330 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:03:41,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-09 19:03:41,363 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/bff3fdba6/af5658ed065e4329bb4b36d17bebe183/FLAG179375fcf [2018-12-09 19:03:41,824 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:03:41,824 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-09 19:03:41,831 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/bff3fdba6/af5658ed065e4329bb4b36d17bebe183/FLAG179375fcf [2018-12-09 19:03:41,840 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/bff3fdba6/af5658ed065e4329bb4b36d17bebe183 [2018-12-09 19:03:41,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:03:41,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:03:41,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:03:41,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:03:41,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:03:41,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:41" (1/1) ... [2018-12-09 19:03:41,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee6021e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:41, skipping insertion in model container [2018-12-09 19:03:41,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:41" (1/1) ... [2018-12-09 19:03:41,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:03:41,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:03:42,100 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:03:42,109 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:03:42,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:03:42,172 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:03:42,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42 WrapperNode [2018-12-09 19:03:42,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:03:42,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:03:42,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:03:42,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:03:42,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:03:42,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:03:42,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:03:42,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:03:42,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... [2018-12-09 19:03:42,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:03:42,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:03:42,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:03:42,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:03:42,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:03:42,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 19:03:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:03:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:03:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-12-09 19:03:42,245 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:03:42,245 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2018-12-09 19:03:42,246 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2018-12-09 19:03:42,246 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 19:03:42,246 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 19:03:42,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:03:42,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:03:42,426 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:03:42,426 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 19:03:42,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:03:42 BoogieIcfgContainer [2018-12-09 19:03:42,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:03:42,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:03:42,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:03:42,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:03:42,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:03:41" (1/3) ... [2018-12-09 19:03:42,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f74dcd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:03:42, skipping insertion in model container [2018-12-09 19:03:42,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:42" (2/3) ... [2018-12-09 19:03:42,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f74dcd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:03:42, skipping insertion in model container [2018-12-09 19:03:42,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:03:42" (3/3) ... [2018-12-09 19:03:42,432 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-12-09 19:03:42,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:03:42,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 19:03:42,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 19:03:42,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:03:42,472 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:03:42,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:03:42,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:03:42,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:03:42,472 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:03:42,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:03:42,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:03:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-09 19:03:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:03:42,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:42,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:42,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:42,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -688468012, now seen corresponding path program 1 times [2018-12-09 19:03:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:42,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:42,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:03:42,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:42,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:03:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:03:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:42,621 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 5 states. [2018-12-09 19:03:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:42,700 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-09 19:03:42,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:03:42,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 19:03:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:42,707 INFO L225 Difference]: With dead ends: 77 [2018-12-09 19:03:42,707 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 19:03:42,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 19:03:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-09 19:03:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 19:03:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-09 19:03:42,734 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 16 [2018-12-09 19:03:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:42,734 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-09 19:03:42,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:03:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-09 19:03:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:03:42,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:42,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:42,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:42,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -688468011, now seen corresponding path program 1 times [2018-12-09 19:03:42,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:42,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:42,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:42,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:42,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:03:42,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:42,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:03:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:03:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:03:42,834 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2018-12-09 19:03:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:42,953 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-09 19:03:42,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:03:42,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 19:03:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:42,955 INFO L225 Difference]: With dead ends: 80 [2018-12-09 19:03:42,955 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 19:03:42,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:03:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 19:03:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-12-09 19:03:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 19:03:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-09 19:03:42,962 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 16 [2018-12-09 19:03:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:42,962 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-09 19:03:42,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:03:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-09 19:03:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:03:42,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:42,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:42,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:42,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash 199035669, now seen corresponding path program 1 times [2018-12-09 19:03:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:42,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:03:43,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:43,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:03:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:03:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:43,006 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-09 19:03:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:43,027 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-09 19:03:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:03:43,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 19:03:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:43,028 INFO L225 Difference]: With dead ends: 71 [2018-12-09 19:03:43,028 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 19:03:43,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 19:03:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 19:03:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:03:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-12-09 19:03:43,032 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 16 [2018-12-09 19:03:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:43,033 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-12-09 19:03:43,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:03:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-12-09 19:03:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:03:43,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:43,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:43,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:43,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash 132315783, now seen corresponding path program 1 times [2018-12-09 19:03:43,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:03:43,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:43,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:03:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:03:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:43,061 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-12-09 19:03:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:43,075 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-12-09 19:03:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:03:43,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 19:03:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:43,076 INFO L225 Difference]: With dead ends: 71 [2018-12-09 19:03:43,076 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 19:03:43,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 19:03:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 19:03:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:03:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-12-09 19:03:43,080 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 17 [2018-12-09 19:03:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:43,080 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-12-09 19:03:43,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:03:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-12-09 19:03:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:03:43,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:43,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:43,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:43,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1875126118, now seen corresponding path program 1 times [2018-12-09 19:03:43,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:43,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:03:43,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:43,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:03:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:03:43,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:03:43,100 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 3 states. [2018-12-09 19:03:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:43,141 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-12-09 19:03:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:03:43,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 19:03:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:43,142 INFO L225 Difference]: With dead ends: 102 [2018-12-09 19:03:43,142 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 19:03:43,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:03:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 19:03:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-12-09 19:03:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 19:03:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-09 19:03:43,146 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 17 [2018-12-09 19:03:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-09 19:03:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:03:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-09 19:03:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 19:03:43,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:43,148 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:43,148 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:43,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1681682425, now seen corresponding path program 1 times [2018-12-09 19:03:43,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:43,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:43,231 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 19:03:43,232 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [50], [51], [53], [55], [114], [115], [116], [118], [120], [121] [2018-12-09 19:03:43,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:43,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:43,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:43,367 INFO L272 AbstractInterpreter]: Visited 18 different actions 26 times. Merged at 4 different actions 8 times. Never widened. Performed 210 root evaluator evaluations with a maximum evaluation depth of 4. Performed 210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-09 19:03:43,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:43,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:43,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:43,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:43,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:43,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:43,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:43,447 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-09 19:03:43,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:43,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:43,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-09 19:03:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:43,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2018-12-09 19:03:43,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:03:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:03:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:03:43,756 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 14 states. [2018-12-09 19:03:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:43,977 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-12-09 19:03:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:03:43,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-09 19:03:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:43,978 INFO L225 Difference]: With dead ends: 72 [2018-12-09 19:03:43,978 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 19:03:43,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-12-09 19:03:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 19:03:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-12-09 19:03:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 19:03:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-12-09 19:03:43,981 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 19 [2018-12-09 19:03:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:43,981 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-12-09 19:03:43,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:03:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-12-09 19:03:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:03:43,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:43,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:43,982 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:43,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:43,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408709, now seen corresponding path program 1 times [2018-12-09 19:03:43,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:43,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:44,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:03:44,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:44,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:03:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:03:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:03:44,015 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 7 states. [2018-12-09 19:03:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:44,082 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-12-09 19:03:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:03:44,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 19:03:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:44,083 INFO L225 Difference]: With dead ends: 90 [2018-12-09 19:03:44,083 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 19:03:44,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:03:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 19:03:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2018-12-09 19:03:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 19:03:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2018-12-09 19:03:44,086 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 27 [2018-12-09 19:03:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:44,086 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2018-12-09 19:03:44,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:03:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-12-09 19:03:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:03:44,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:44,087 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:44,087 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:44,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408708, now seen corresponding path program 1 times [2018-12-09 19:03:44,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:44,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:44,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:44,136 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 19:03:44,136 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [73], [91], [99], [102], [114], [115], [116], [118], [120], [121], [122] [2018-12-09 19:03:44,137 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:44,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:44,195 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:03:44,195 INFO L272 AbstractInterpreter]: Visited 21 different actions 36 times. Merged at 4 different actions 10 times. Never widened. Performed 325 root evaluator evaluations with a maximum evaluation depth of 4. Performed 325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 19:03:44,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:44,197 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:03:44,246 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 83.65% of their original sizes. [2018-12-09 19:03:44,246 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:03:44,289 INFO L418 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-12-09 19:03:44,289 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:03:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:03:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-12-09 19:03:44,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:03:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:03:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:03:44,290 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 11 states. [2018-12-09 19:03:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:44,609 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-12-09 19:03:44,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:03:44,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-09 19:03:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:44,610 INFO L225 Difference]: With dead ends: 97 [2018-12-09 19:03:44,610 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 19:03:44,610 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:03:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 19:03:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2018-12-09 19:03:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 19:03:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-09 19:03:44,614 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 27 [2018-12-09 19:03:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:44,615 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-09 19:03:44,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:03:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-09 19:03:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:03:44,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:44,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:44,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:44,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash 772215704, now seen corresponding path program 1 times [2018-12-09 19:03:44,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:44,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:44,653 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-09 19:03:44,653 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [75], [77], [82], [84], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:44,654 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:44,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:44,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:44,688 INFO L272 AbstractInterpreter]: Visited 26 different actions 52 times. Merged at 4 different actions 10 times. Never widened. Performed 433 root evaluator evaluations with a maximum evaluation depth of 4. Performed 433 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 19:03:44,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:44,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:44,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:44,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:44,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:44,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:44,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:44,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:44,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-09 19:03:44,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:44,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:03:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:03:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:03:44,778 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 9 states. [2018-12-09 19:03:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:44,804 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 19:03:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:03:44,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 19:03:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:44,805 INFO L225 Difference]: With dead ends: 78 [2018-12-09 19:03:44,805 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 19:03:44,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:03:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 19:03:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-09 19:03:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 19:03:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 19:03:44,808 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 32 [2018-12-09 19:03:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:44,808 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 19:03:44,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:03:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 19:03:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:03:44,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:44,809 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:44,809 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:44,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash 42020810, now seen corresponding path program 2 times [2018-12-09 19:03:44,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:44,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:44,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:44,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:03:44,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:03:44,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:44,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:44,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:03:44,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:03:44,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 19:03:44,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:03:44,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:44,878 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-09 19:03:44,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:44,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:44,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:03:45,162 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| 1))) is different from true [2018-12-09 19:03:45,167 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 12 treesize of output 11 [2018-12-09 19:03:45,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:45,170 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-09 19:03:45,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 19:03:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2018-12-09 19:03:45,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 19:03:45,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:45,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2018-12-09 19:03:45,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:45,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:03:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:03:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2018-12-09 19:03:45,251 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 14 states. [2018-12-09 19:03:45,767 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-09 19:03:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:45,962 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2018-12-09 19:03:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:03:45,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-12-09 19:03:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:45,963 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:03:45,963 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 19:03:45,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=497, Unknown=2, NotChecked=46, Total=650 [2018-12-09 19:03:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 19:03:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2018-12-09 19:03:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 19:03:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-12-09 19:03:45,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 35 [2018-12-09 19:03:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:45,967 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-12-09 19:03:45,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:03:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-12-09 19:03:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:03:45,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:45,968 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:45,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:45,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 815287897, now seen corresponding path program 1 times [2018-12-09 19:03:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:45,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:03:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:45,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:46,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:46,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:46,027 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-09 19:03:46,027 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [75], [77], [82], [85], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:46,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:46,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:46,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:46,045 INFO L272 AbstractInterpreter]: Visited 26 different actions 37 times. Merged at 3 different actions 6 times. Never widened. Performed 291 root evaluator evaluations with a maximum evaluation depth of 4. Performed 291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 19:03:46,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:46,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:46,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:46,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:46,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:46,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:46,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:46,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-12-09 19:03:46,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:46,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:03:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:03:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:03:46,185 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 13 states. [2018-12-09 19:03:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:46,224 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-12-09 19:03:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:03:46,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-09 19:03:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:46,226 INFO L225 Difference]: With dead ends: 92 [2018-12-09 19:03:46,226 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 19:03:46,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:03:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 19:03:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-09 19:03:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 19:03:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-12-09 19:03:46,229 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 38 [2018-12-09 19:03:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:46,229 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-12-09 19:03:46,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:03:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-12-09 19:03:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 19:03:46,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:46,230 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:46,230 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:46,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash -989528821, now seen corresponding path program 2 times [2018-12-09 19:03:46,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:46,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:46,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:46,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:46,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:03:46,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:03:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:46,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:46,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:03:46,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:03:46,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 19:03:46,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:03:46,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:46,303 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-09 19:03:46,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:46,312 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-09 19:03:46,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:46,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:46,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-09 19:03:46,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:03:46,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:03:46,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:46,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:03:46,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:03:46,456 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-09 19:03:46,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:46,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:03:46,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-09 19:03:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-09 19:03:46,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:46,567 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-09 19:03:51,047 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 72 DAG size of output: 25 [2018-12-09 19:03:51,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-09 19:03:51,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-09 19:03:51,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,572 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 19:03:51,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 19:03:51,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:26, output treesize:5 [2018-12-09 19:03:51,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 19:03:51,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-09 19:03:51,699 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 19:03:51,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-09 19:03:51,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:51,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:03:51,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:31, output treesize:14 [2018-12-09 19:03:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-09 19:03:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:51,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2018-12-09 19:03:51,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:51,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:03:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:03:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=673, Unknown=1, NotChecked=0, Total=756 [2018-12-09 19:03:51,753 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 18 states. [2018-12-09 19:03:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:54,281 INFO L93 Difference]: Finished difference Result 208 states and 240 transitions. [2018-12-09 19:03:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:03:54,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-12-09 19:03:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:54,283 INFO L225 Difference]: With dead ends: 208 [2018-12-09 19:03:54,283 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 19:03:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=254, Invalid=1637, Unknown=1, NotChecked=0, Total=1892 [2018-12-09 19:03:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 19:03:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 97. [2018-12-09 19:03:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 19:03:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-09 19:03:54,288 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 41 [2018-12-09 19:03:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:54,288 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-09 19:03:54,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:03:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-09 19:03:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:03:54,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:54,289 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:54,289 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:54,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash 29872388, now seen corresponding path program 1 times [2018-12-09 19:03:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:03:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 19:03:54,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:54,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:03:54,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:54,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:03:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:03:54,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:54,317 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2018-12-09 19:03:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:54,332 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2018-12-09 19:03:54,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:03:54,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 19:03:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:54,333 INFO L225 Difference]: With dead ends: 129 [2018-12-09 19:03:54,334 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 19:03:54,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:03:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 19:03:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2018-12-09 19:03:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 19:03:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-12-09 19:03:54,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 46 [2018-12-09 19:03:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:54,336 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-12-09 19:03:54,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:03:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-12-09 19:03:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:03:54,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:54,337 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:54,337 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:54,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1772682723, now seen corresponding path program 1 times [2018-12-09 19:03:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:54,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:54,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:54,388 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-09 19:03:54,388 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [75], [77], [80], [91], [99], [102], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:54,389 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:54,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:54,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 19:03:54,423 INFO L272 AbstractInterpreter]: Visited 28 different actions 82 times. Merged at 6 different actions 22 times. Widened at 1 different actions 1 times. Performed 602 root evaluator evaluations with a maximum evaluation depth of 4. Performed 602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 30 variables. [2018-12-09 19:03:54,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:54,425 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 19:03:54,452 INFO L227 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 80.37% of their original sizes. [2018-12-09 19:03:54,452 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 19:03:54,536 INFO L418 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-12-09 19:03:54,536 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 19:03:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:03:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 24 [2018-12-09 19:03:54,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:54,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:03:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:03:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:03:54,537 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 16 states. [2018-12-09 19:03:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:54,960 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-12-09 19:03:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:03:54,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-09 19:03:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:54,961 INFO L225 Difference]: With dead ends: 109 [2018-12-09 19:03:54,961 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 19:03:54,962 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:03:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 19:03:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-09 19:03:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 19:03:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-12-09 19:03:54,964 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 46 [2018-12-09 19:03:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:54,965 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-12-09 19:03:54,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:03:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-12-09 19:03:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:03:54,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:54,965 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:54,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:54,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1890768075, now seen corresponding path program 1 times [2018-12-09 19:03:54,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:54,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 19:03:55,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:55,029 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-09 19:03:55,029 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [73], [75], [77], [82], [83], [87], [91], [99], [102], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:55,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:55,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:55,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:55,076 INFO L272 AbstractInterpreter]: Visited 31 different actions 120 times. Merged at 14 different actions 44 times. Never widened. Performed 1004 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1004 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-09 19:03:55,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:55,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:55,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:55,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:55,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:55,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:03:55,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2018-12-09 19:03:55,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:55,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:03:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:03:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-12-09 19:03:55,283 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 19 states. [2018-12-09 19:03:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:55,482 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-12-09 19:03:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 19:03:55,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-09 19:03:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:55,483 INFO L225 Difference]: With dead ends: 127 [2018-12-09 19:03:55,484 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 19:03:55,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 19:03:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 19:03:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-12-09 19:03:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 19:03:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-12-09 19:03:55,488 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 49 [2018-12-09 19:03:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:55,488 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-12-09 19:03:55,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:03:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-12-09 19:03:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:03:55,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:55,489 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:55,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:55,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1840615610, now seen corresponding path program 1 times [2018-12-09 19:03:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:55,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:55,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:55,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:55,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:55,547 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 19:03:55,547 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [73], [75], [77], [82], [83], [87], [91], [99], [100], [103], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:55,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:55,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:55,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:55,576 INFO L272 AbstractInterpreter]: Visited 32 different actions 65 times. Merged at 9 different actions 18 times. Never widened. Performed 505 root evaluator evaluations with a maximum evaluation depth of 4. Performed 505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-09 19:03:55,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:55,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:55,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:55,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:55,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:03:55,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:55,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:55,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-09 19:03:55,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:55,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:03:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:03:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:03:55,753 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-12-09 19:03:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:55,798 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-12-09 19:03:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:03:55,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-12-09 19:03:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:55,799 INFO L225 Difference]: With dead ends: 116 [2018-12-09 19:03:55,799 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 19:03:55,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:03:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 19:03:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-12-09 19:03:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 19:03:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-12-09 19:03:55,803 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 53 [2018-12-09 19:03:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-12-09 19:03:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:03:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-12-09 19:03:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:03:55,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:55,804 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:55,804 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:55,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 345523796, now seen corresponding path program 2 times [2018-12-09 19:03:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:55,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:55,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:55,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:55,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:03:55,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:03:55,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:55,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:03:55,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:03:55,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 19:03:55,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:03:55,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:55,927 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 15 treesize of output 12 [2018-12-09 19:03:55,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:03:55,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 19:03:55,956 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 23 treesize of output 19 [2018-12-09 19:03:55,957 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 19 treesize of output 3 [2018-12-09 19:03:55,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:55,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-12-09 19:03:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-09 19:03:55,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-09 19:03:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:03:55,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [12] total 19 [2018-12-09 19:03:55,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:55,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:03:55,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:03:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:03:55,998 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 9 states. [2018-12-09 19:03:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:56,127 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-12-09 19:03:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:03:56,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-12-09 19:03:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:56,128 INFO L225 Difference]: With dead ends: 122 [2018-12-09 19:03:56,128 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 19:03:56,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:03:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 19:03:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-12-09 19:03:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 19:03:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-12-09 19:03:56,131 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 56 [2018-12-09 19:03:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-12-09 19:03:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:03:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-12-09 19:03:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:03:56,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:56,133 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:56,133 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:56,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:56,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2121303220, now seen corresponding path program 1 times [2018-12-09 19:03:56,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:56,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:03:56,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:56,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:56,200 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 19:03:56,200 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [6], [7], [36], [38], [42], [48], [50], [51], [55], [67], [73], [75], [77], [82], [83], [87], [91], [99], [100], [104], [105], [114], [115], [116], [118], [120], [121], [122], [126], [127] [2018-12-09 19:03:56,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:56,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:56,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:56,253 INFO L272 AbstractInterpreter]: Visited 33 different actions 126 times. Merged at 16 different actions 46 times. Never widened. Performed 1052 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1052 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-09 19:03:56,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:56,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:56,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:56,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:56,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:56,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:56,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:03:56,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:56,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-09 19:03:56,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:56,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:03:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:03:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=299, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:03:56,456 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 21 states. [2018-12-09 19:03:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:56,515 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-12-09 19:03:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:03:56,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-09 19:03:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:56,516 INFO L225 Difference]: With dead ends: 120 [2018-12-09 19:03:56,516 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 19:03:56,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=299, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:03:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 19:03:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-12-09 19:03:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 19:03:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-12-09 19:03:56,519 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 57 [2018-12-09 19:03:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:56,520 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-12-09 19:03:56,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:03:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-12-09 19:03:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:03:56,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:56,520 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:56,520 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:56,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash -390060862, now seen corresponding path program 2 times [2018-12-09 19:03:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:03:56,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:56,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:56,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:03:56,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:03:56,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:56,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:03:56,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:03:56,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 19:03:56,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:03:56,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:56,616 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-09 19:03:56,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:03:56,643 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 15 treesize of output 12 [2018-12-09 19:03:56,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:03:56,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,648 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-09 19:03:56,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-12-09 19:03:56,675 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 21 [2018-12-09 19:03:56,677 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 21 treesize of output 5 [2018-12-09 19:03:56,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:56,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-12-09 19:03:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 19:03:56,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 19:03:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:03:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [13] total 20 [2018-12-09 19:03:56,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:56,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:03:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:03:56,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:03:56,731 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 9 states. [2018-12-09 19:03:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:56,868 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-12-09 19:03:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:03:56,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-09 19:03:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:56,868 INFO L225 Difference]: With dead ends: 132 [2018-12-09 19:03:56,868 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 19:03:56,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-12-09 19:03:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 19:03:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2018-12-09 19:03:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-09 19:03:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-12-09 19:03:56,871 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 60 [2018-12-09 19:03:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:56,871 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-12-09 19:03:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:03:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-12-09 19:03:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:03:56,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:56,871 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:56,872 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:56,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -683463869, now seen corresponding path program 1 times [2018-12-09 19:03:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:03:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 19:03:56,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:03:56,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:03:56,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:03:56,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:03:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:03:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:56,899 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 5 states. [2018-12-09 19:03:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:56,907 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-12-09 19:03:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:03:56,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-09 19:03:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:56,909 INFO L225 Difference]: With dead ends: 134 [2018-12-09 19:03:56,909 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 19:03:56,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:03:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 19:03:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 120. [2018-12-09 19:03:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 19:03:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-12-09 19:03:56,912 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 60 [2018-12-09 19:03:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:56,913 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-12-09 19:03:56,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:03:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-12-09 19:03:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:03:56,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:56,913 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:56,914 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:56,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:56,914 INFO L82 PathProgramCache]: Analyzing trace with hash -600623899, now seen corresponding path program 1 times [2018-12-09 19:03:56,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:56,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:56,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:56,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-09 19:03:56,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:56,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:56,977 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-09 19:03:56,977 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [14], [22], [24], [36], [38], [42], [48], [50], [51], [55], [60], [67], [75], [77], [80], [91], [97], [112], [113], [114], [115], [116], [118], [120], [121], [122], [123], [124], [126], [127] [2018-12-09 19:03:56,978 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:56,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:57,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:57,015 INFO L272 AbstractInterpreter]: Visited 36 different actions 79 times. Merged at 8 different actions 18 times. Never widened. Performed 585 root evaluator evaluations with a maximum evaluation depth of 4. Performed 585 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 3 different actions. Largest state had 31 variables. [2018-12-09 19:03:57,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:57,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:57,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:57,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:57,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:57,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:03:57,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:03:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:03:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2018-12-09 19:03:57,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:03:57,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:03:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:03:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2018-12-09 19:03:57,265 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 19 states. [2018-12-09 19:03:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:03:57,520 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-12-09 19:03:57,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 19:03:57,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-12-09 19:03:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:03:57,521 INFO L225 Difference]: With dead ends: 149 [2018-12-09 19:03:57,521 INFO L226 Difference]: Without dead ends: 149 [2018-12-09 19:03:57,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=442, Invalid=1538, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 19:03:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-09 19:03:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2018-12-09 19:03:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 19:03:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-12-09 19:03:57,525 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 62 [2018-12-09 19:03:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:03:57,525 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-12-09 19:03:57,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:03:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-12-09 19:03:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:03:57,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:03:57,526 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:03:57,526 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err0REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION]=== [2018-12-09 19:03:57,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703016, now seen corresponding path program 1 times [2018-12-09 19:03:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:03:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:03:57,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:03:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:03:57,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:57,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:03:57,603 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-09 19:03:57,603 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [14], [22], [25], [36], [38], [42], [48], [50], [51], [55], [60], [67], [75], [77], [80], [91], [97], [112], [113], [114], [115], [116], [118], [120], [121], [122], [123], [124], [126], [127] [2018-12-09 19:03:57,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:03:57,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:03:57,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:03:57,638 INFO L272 AbstractInterpreter]: Visited 36 different actions 106 times. Merged at 8 different actions 26 times. Widened at 1 different actions 1 times. Performed 770 root evaluator evaluations with a maximum evaluation depth of 4. Performed 770 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 31 variables. [2018-12-09 19:03:57,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:03:57,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:03:57,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:03:57,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:03:57,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:03:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:03:57,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:03:57,686 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-09 19:03:57,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:03:57,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:03:57,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-09 19:03:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 19:03:57,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:03:58,103 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:03:58,103 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 71353 column 11: unknown constant v_prenex_14 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:114) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:668) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:760) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 19:03:58,106 INFO L168 Benchmark]: Toolchain (without parser) took 16262.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.0 MB). Free memory was 953.4 MB in the beginning and 823.3 MB in the end (delta: 130.1 MB). Peak memory consumption was 357.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:03:58,106 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:03:58,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:03:58,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.35 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-09 19:03:58,107 INFO L168 Benchmark]: Boogie Preprocessor took 19.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-09 19:03:58,107 INFO L168 Benchmark]: RCFGBuilder took 213.77 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:03:58,107 INFO L168 Benchmark]: TraceAbstraction took 15677.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 823.3 MB in the end (delta: 215.8 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:03:58,109 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.35 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 19.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. * RCFGBuilder took 213.77 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15677.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 823.3 MB in the end (delta: 215.8 MB). Peak memory consumption was 343.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 71353 column 11: unknown constant v_prenex_14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 71353 column 11: unknown constant v_prenex_14: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:03:59,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:03:59,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:03:59,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:03:59,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:03:59,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:03:59,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:03:59,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:03:59,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:03:59,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:03:59,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:03:59,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:03:59,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:03:59,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:03:59,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:03:59,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:03:59,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:03:59,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:03:59,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:03:59,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:03:59,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:03:59,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:03:59,363 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:03:59,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:03:59,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:03:59,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:03:59,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:03:59,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:03:59,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:03:59,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:03:59,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:03:59,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:03:59,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:03:59,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:03:59,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:03:59,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:03:59,367 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 19:03:59,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:03:59,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:03:59,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:03:59,375 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:03:59,375 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:03:59,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:03:59,375 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:03:59,375 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:03:59,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:03:59,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:03:59,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:03:59,377 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:03:59,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:03:59,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:03:59,378 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:03:59,378 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_683eafb2-7492-41b6-8976-684f0b81a00a/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 -> 708e975f6ded0cfba15d7fd51cdde51c174d1f46 [2018-12-09 19:03:59,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:03:59,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:03:59,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:03:59,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:03:59,411 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:03:59,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-09 19:03:59,454 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/2222bbc65/4e2b84b7348942ed9b6cbba09237d2f0/FLAG15cea48da [2018-12-09 19:03:59,893 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:03:59,893 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-12-09 19:03:59,901 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/2222bbc65/4e2b84b7348942ed9b6cbba09237d2f0/FLAG15cea48da [2018-12-09 19:03:59,909 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/data/2222bbc65/4e2b84b7348942ed9b6cbba09237d2f0 [2018-12-09 19:03:59,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:03:59,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:03:59,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:03:59,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:03:59,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:03:59,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:59" (1/1) ... [2018-12-09 19:03:59,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca2d0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:03:59, skipping insertion in model container [2018-12-09 19:03:59,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:03:59" (1/1) ... [2018-12-09 19:03:59,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:03:59,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:04:00,138 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:04:00,151 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:04:00,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:04:00,259 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:04:00,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00 WrapperNode [2018-12-09 19:04:00,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:04:00,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:04:00,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:04:00,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:04:00,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:04:00,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:04:00,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:04:00,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:04:00,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... [2018-12-09 19:04:00,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:04:00,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:04:00,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:04:00,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:04:00,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 19:04:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:04:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:04:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:04:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-12-09 19:04:00,339 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2018-12-09 19:04:00,339 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 19:04:00,339 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 19:04:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:04:00,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:04:00,584 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:04:00,584 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 19:04:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:04:00 BoogieIcfgContainer [2018-12-09 19:04:00,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:04:00,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:04:00,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:04:00,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:04:00,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:03:59" (1/3) ... [2018-12-09 19:04:00,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555930e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:04:00, skipping insertion in model container [2018-12-09 19:04:00,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:04:00" (2/3) ... [2018-12-09 19:04:00,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555930e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:04:00, skipping insertion in model container [2018-12-09 19:04:00,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:04:00" (3/3) ... [2018-12-09 19:04:00,590 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-12-09 19:04:00,599 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:04:00,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 19:04:00,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 19:04:00,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 19:04:00,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:04:00,633 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:04:00,633 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:04:00,633 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:04:00,633 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:04:00,633 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:04:00,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:04:00,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:04:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-12-09 19:04:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:04:00,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:00,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:00,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:00,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash -688468012, now seen corresponding path program 1 times [2018-12-09 19:04:00,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:00,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:00,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:00,756 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-09 19:04:00,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:00,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:00,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:04:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:00,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:00,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:00,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:04:00,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:00,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:00,794 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 5 states. [2018-12-09 19:04:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:00,952 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-09 19:04:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:04:00,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 19:04:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:00,960 INFO L225 Difference]: With dead ends: 77 [2018-12-09 19:04:00,960 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 19:04:00,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 19:04:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-09 19:04:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 19:04:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2018-12-09 19:04:00,987 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 16 [2018-12-09 19:04:00,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:00,987 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2018-12-09 19:04:00,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2018-12-09 19:04:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:04:00,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:00,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:00,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:00,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -688468011, now seen corresponding path program 1 times [2018-12-09 19:04:00,989 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:01,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:04:01,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:01,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:01,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:04:01,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:04:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:04:01,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:04:01,127 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 8 states. [2018-12-09 19:04:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:01,397 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-09 19:04:01,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:04:01,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 19:04:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:01,398 INFO L225 Difference]: With dead ends: 80 [2018-12-09 19:04:01,398 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 19:04:01,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:04:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 19:04:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-12-09 19:04:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 19:04:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-09 19:04:01,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 16 [2018-12-09 19:04:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:01,404 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-09 19:04:01,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:04:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-09 19:04:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 19:04:01,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:01,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:01,405 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:01,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash 199035669, now seen corresponding path program 1 times [2018-12-09 19:04:01,405 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:01,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:01,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:01,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:01,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:01,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:01,474 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-09 19:04:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:01,500 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-09 19:04:01,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:04:01,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 19:04:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:01,502 INFO L225 Difference]: With dead ends: 71 [2018-12-09 19:04:01,502 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 19:04:01,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 19:04:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 19:04:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:04:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-12-09 19:04:01,508 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 16 [2018-12-09 19:04:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:01,509 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-12-09 19:04:01,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-12-09 19:04:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:04:01,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:01,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:01,510 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 132315783, now seen corresponding path program 1 times [2018-12-09 19:04:01,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:01,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,554 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:01,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:01,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:04:01,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:04:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:04:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:01,555 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-12-09 19:04:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:01,594 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-12-09 19:04:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:04:01,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 19:04:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:01,595 INFO L225 Difference]: With dead ends: 71 [2018-12-09 19:04:01,595 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 19:04:01,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:04:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 19:04:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 19:04:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:04:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-12-09 19:04:01,601 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 17 [2018-12-09 19:04:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:01,601 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-12-09 19:04:01,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:04:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-12-09 19:04:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:04:01,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:01,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:01,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:01,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1875126118, now seen corresponding path program 1 times [2018-12-09 19:04:01,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:01,603 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:04:01,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:04:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:04:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:04:01,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:04:01,645 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 3 states. [2018-12-09 19:04:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:01,744 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-12-09 19:04:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:04:01,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 19:04:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:01,745 INFO L225 Difference]: With dead ends: 102 [2018-12-09 19:04:01,745 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 19:04:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:04:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 19:04:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-12-09 19:04:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 19:04:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-09 19:04:01,750 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 17 [2018-12-09 19:04:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:01,751 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-09 19:04:01,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:04:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-09 19:04:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 19:04:01,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:01,752 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:01,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:01,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1681682425, now seen corresponding path program 1 times [2018-12-09 19:04:01,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:01,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:01,824 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-09 19:04:01,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:01,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:01,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:01,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:02,766 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 19:04:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:02,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:04:02,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:04:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:03,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:03,017 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-09 19:04:03,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:03,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:03,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:03,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:04:03,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8] total 21 [2018-12-09 19:04:03,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 19:04:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 19:04:03,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:04:03,680 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 22 states. [2018-12-09 19:04:04,958 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 19:04:05,627 WARN L180 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-09 19:04:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:06,136 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-12-09 19:04:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:04:06,137 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-12-09 19:04:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:06,138 INFO L225 Difference]: With dead ends: 80 [2018-12-09 19:04:06,138 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 19:04:06,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:04:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 19:04:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-09 19:04:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 19:04:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-12-09 19:04:06,143 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 19 [2018-12-09 19:04:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:06,143 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-12-09 19:04:06,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 19:04:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-12-09 19:04:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:04:06,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:06,144 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:06,145 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:06,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1659408709, now seen corresponding path program 1 times [2018-12-09 19:04:06,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:06,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:06,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:06,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:04:06,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:04:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:06,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:06,306 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-09 19:04:06,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:06,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:06,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:04:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:04:06,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:06,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:04:06,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 15 [2018-12-09 19:04:06,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:04:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:04:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:04:06,378 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 15 states. [2018-12-09 19:04:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:06,944 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-09 19:04:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:04:06,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-12-09 19:04:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:06,945 INFO L225 Difference]: With dead ends: 104 [2018-12-09 19:04:06,945 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 19:04:06,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-12-09 19:04:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 19:04:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-12-09 19:04:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 19:04:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-12-09 19:04:06,950 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 27 [2018-12-09 19:04:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:06,950 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-12-09 19:04:06,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:04:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-12-09 19:04:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:04:06,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:06,951 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:06,951 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:06,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 334312789, now seen corresponding path program 2 times [2018-12-09 19:04:06,952 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:06,970 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 19:04:07,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:04:07,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:04:07,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:07,064 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-09 19:04:07,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:07,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:07,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:07,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:08,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:04:08,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:04:08,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:04:08,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:04:08,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:04:08,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:08,419 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-09 19:04:08,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:08,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:08,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:08,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:10,882 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-09 19:04:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:11,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:04:11,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 13] total 31 [2018-12-09 19:04:11,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 19:04:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 19:04:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-12-09 19:04:11,266 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 32 states. [2018-12-09 19:04:14,780 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2018-12-09 19:04:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:15,264 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2018-12-09 19:04:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:04:15,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2018-12-09 19:04:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:15,265 INFO L225 Difference]: With dead ends: 103 [2018-12-09 19:04:15,265 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 19:04:15,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=416, Invalid=1840, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 19:04:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 19:04:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-12-09 19:04:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 19:04:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-09 19:04:15,269 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 28 [2018-12-09 19:04:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:15,270 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-09 19:04:15,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 19:04:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-09 19:04:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 19:04:15,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:15,270 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:15,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:15,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1183672004, now seen corresponding path program 1 times [2018-12-09 19:04:15,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:15,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:04:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:15,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:15,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:15,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:04:15,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:04:15,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:04:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:04:15,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 19:04:15,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:04:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:04:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2018-12-09 19:04:15,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 19:04:15,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 19:04:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:04:15,698 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-12-09 19:04:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:04:16,371 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-09 19:04:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:04:16,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-12-09 19:04:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:04:16,372 INFO L225 Difference]: With dead ends: 112 [2018-12-09 19:04:16,372 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 19:04:16,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-12-09 19:04:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 19:04:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2018-12-09 19:04:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 19:04:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-12-09 19:04:16,376 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 39 [2018-12-09 19:04:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:04:16,376 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-12-09 19:04:16,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 19:04:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-12-09 19:04:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:04:16,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:04:16,376 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:04:16,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:04:16,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:04:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 419550613, now seen corresponding path program 3 times [2018-12-09 19:04:16,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:04:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:04:16,391 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 19:04:16,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 19:04:16,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:04:16,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:04:16,692 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-09 19:04:16,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:04:16,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:04:16,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:04:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:17,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:04:17,537 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-09 19:04:18,941 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-09 19:04:23,347 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-09 19:04:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:04:23,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:04:23,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:04:23,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:05:05,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 19:05:05,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:05:05,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:05,545 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-09 19:05:05,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:05,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:05,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:05:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:05:05,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:10,379 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-09 19:05:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:05:10,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:05:10,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 18, 19] total 48 [2018-12-09 19:05:10,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-09 19:05:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-09 19:05:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1810, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 19:05:10,952 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 48 states. [2018-12-09 19:05:11,672 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-09 19:05:12,305 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 19:05:15,768 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 154 [2018-12-09 19:05:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:17,975 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-12-09 19:05:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 19:05:17,977 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-12-09 19:05:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:17,977 INFO L225 Difference]: With dead ends: 103 [2018-12-09 19:05:17,977 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 19:05:17,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 19:05:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 19:05:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-09 19:05:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 19:05:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-12-09 19:05:17,980 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 46 [2018-12-09 19:05:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:17,981 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-12-09 19:05:17,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-09 19:05:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-12-09 19:05:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:05:17,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:17,981 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:17,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:17,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 361864856, now seen corresponding path program 1 times [2018-12-09 19:05:17,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:17,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/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-09 19:05:17,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:05:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:18,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:18,169 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-09 19:05:18,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:18,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:18,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:05:20,224 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-09 19:05:20,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:20,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:20,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 19:05:20,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:20,237 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-09 19:05:20,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 19:05:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2018-12-09 19:05:20,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:20,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:20,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:20,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:20,337 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-09 19:05:20,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:20,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:20,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:05:20,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:20,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:20,346 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-09 19:05:20,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:20,352 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-09 19:05:20,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 19:05:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2018-12-09 19:05:20,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:20,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:20,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 19:05:20,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:05:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:05:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2018-12-09 19:05:20,402 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 10 states. [2018-12-09 19:05:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:22,808 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2018-12-09 19:05:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:05:22,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-09 19:05:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:22,809 INFO L225 Difference]: With dead ends: 150 [2018-12-09 19:05:22,809 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 19:05:22,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2018-12-09 19:05:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 19:05:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2018-12-09 19:05:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 19:05:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-12-09 19:05:22,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 56 [2018-12-09 19:05:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-12-09 19:05:22,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:05:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-12-09 19:05:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:05:22,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:22,813 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:22,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:22,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 361864857, now seen corresponding path program 1 times [2018-12-09 19:05:22,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:23,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:23,121 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-09 19:05:23,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,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 6 treesize of output 5 [2018-12-09 19:05:23,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:05:23,801 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-09 19:05:23,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:23,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:23,809 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-09 19:05:23,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:05:23,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:23,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-09 19:05:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2018-12-09 19:05:23,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:24,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:24,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:24,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:24,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:24,220 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-09 19:05:24,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,227 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-09 19:05:24,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:05:24,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:24,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:24,244 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-09 19:05:24,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:05:24,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:24,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 19:05:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2018-12-09 19:05:24,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:24,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 19:05:24,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:05:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:05:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-12-09 19:05:24,467 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 12 states. [2018-12-09 19:05:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:25,323 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-12-09 19:05:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:05:25,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-09 19:05:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:25,324 INFO L225 Difference]: With dead ends: 152 [2018-12-09 19:05:25,324 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 19:05:25,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2018-12-09 19:05:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 19:05:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-12-09 19:05:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 19:05:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-12-09 19:05:25,329 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 56 [2018-12-09 19:05:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:25,329 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-12-09 19:05:25,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:05:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-12-09 19:05:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:05:25,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:25,331 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:25,331 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:25,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 437176094, now seen corresponding path program 1 times [2018-12-09 19:05:25,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:25,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:25,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:05:25,491 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:05:25,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:05:25,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:05:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:05:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:05:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:05:25,494 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 5 states. [2018-12-09 19:05:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:25,555 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2018-12-09 19:05:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:05:25,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 19:05:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:25,556 INFO L225 Difference]: With dead ends: 142 [2018-12-09 19:05:25,556 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 19:05:25,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:05:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 19:05:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-12-09 19:05:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 19:05:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-12-09 19:05:25,559 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 58 [2018-12-09 19:05:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:25,559 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-12-09 19:05:25,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:05:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-12-09 19:05:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:05:25,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:25,560 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:25,560 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:25,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1633252789, now seen corresponding path program 1 times [2018-12-09 19:05:25,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:25,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:25,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:05:25,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:05:25,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:25,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:25,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:25,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:05:25,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:05:25,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:05:25,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-09 19:05:25,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:05:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:05:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:05:25,864 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-12-09 19:05:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:26,030 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2018-12-09 19:05:26,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:05:26,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-12-09 19:05:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:26,031 INFO L225 Difference]: With dead ends: 234 [2018-12-09 19:05:26,032 INFO L226 Difference]: Without dead ends: 234 [2018-12-09 19:05:26,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:05:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-09 19:05:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2018-12-09 19:05:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-09 19:05:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2018-12-09 19:05:26,036 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 61 [2018-12-09 19:05:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:26,036 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2018-12-09 19:05:26,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:05:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2018-12-09 19:05:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:05:26,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:26,037 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:26,038 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:26,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1353712470, now seen corresponding path program 1 times [2018-12-09 19:05:26,038 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:26,038 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:26,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:05:26,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:05:26,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:05:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:05:26,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:05:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:05:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:05:26,103 INFO L87 Difference]: Start difference. First operand 157 states and 196 transitions. Second operand 5 states. [2018-12-09 19:05:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:26,139 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2018-12-09 19:05:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:05:26,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 19:05:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:26,141 INFO L225 Difference]: With dead ends: 196 [2018-12-09 19:05:26,141 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 19:05:26,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:05:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 19:05:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2018-12-09 19:05:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-09 19:05:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2018-12-09 19:05:26,145 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 65 [2018-12-09 19:05:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:26,145 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2018-12-09 19:05:26,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:05:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-12-09 19:05:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:05:26,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:26,146 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:26,146 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:26,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703017, now seen corresponding path program 1 times [2018-12-09 19:05:26,146 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:26,146 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:26,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:26,296 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-09 19:05:26,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:05:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:05:26,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:26,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:26,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:26,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:26,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:26,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:05:26,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:05:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:05:26,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:26,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 19:05:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:05:26,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:05:26,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=50, Unknown=6, NotChecked=0, Total=72 [2018-12-09 19:05:26,485 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand 8 states. [2018-12-09 19:05:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:26,782 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2018-12-09 19:05:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:05:26,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-12-09 19:05:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:26,783 INFO L225 Difference]: With dead ends: 186 [2018-12-09 19:05:26,783 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 19:05:26,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=89, Unknown=9, NotChecked=0, Total=132 [2018-12-09 19:05:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 19:05:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2018-12-09 19:05:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-09 19:05:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2018-12-09 19:05:26,786 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 65 [2018-12-09 19:05:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2018-12-09 19:05:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:05:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2018-12-09 19:05:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:05:26,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:26,787 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:26,787 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:26,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1433703016, now seen corresponding path program 1 times [2018-12-09 19:05:26,787 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:26,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:26,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:26,952 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-09 19:05:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:26,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:05:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:05:27,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:27,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:27,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:27,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:27,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:27,347 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-09 19:05:27,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:27,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:27,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:05:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:05:27,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:29,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:29,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 19:05:29,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:05:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:05:29,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=176, Unknown=1, NotChecked=0, Total=210 [2018-12-09 19:05:29,669 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand 10 states. [2018-12-09 19:05:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:30,276 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-12-09 19:05:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:05:30,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-12-09 19:05:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:30,277 INFO L225 Difference]: With dead ends: 210 [2018-12-09 19:05:30,277 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 19:05:30,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=75, Invalid=386, Unknown=1, NotChecked=0, Total=462 [2018-12-09 19:05:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 19:05:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 190. [2018-12-09 19:05:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-09 19:05:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2018-12-09 19:05:30,280 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 65 [2018-12-09 19:05:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:30,281 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2018-12-09 19:05:30,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:05:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2018-12-09 19:05:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:05:30,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:30,281 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:30,281 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:30,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1459650496, now seen corresponding path program 1 times [2018-12-09 19:05:30,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:30,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:30,640 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-09 19:05:30,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:30,647 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-09 19:05:30,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:30,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:30,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:05:32,008 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-09 19:05:32,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,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-09 19:05:32,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:05:32,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:05:32,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,088 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-09 19:05:32,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:05:32,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:05:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2018-12-09 19:05:32,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:32,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:32,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:32,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:32,540 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-09 19:05:32,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 19:05:32,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:05:32,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:05:32,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 19:05:32,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 19:05:32,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:05:32,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:32,651 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-09 19:05:32,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:32,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:05:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2018-12-09 19:05:32,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:32,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:32,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-09 19:05:32,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:05:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:05:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2018-12-09 19:05:32,902 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand 14 states. [2018-12-09 19:05:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:34,114 INFO L93 Difference]: Finished difference Result 248 states and 305 transitions. [2018-12-09 19:05:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:05:34,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-12-09 19:05:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:34,115 INFO L225 Difference]: With dead ends: 248 [2018-12-09 19:05:34,115 INFO L226 Difference]: Without dead ends: 248 [2018-12-09 19:05:34,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2018-12-09 19:05:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-09 19:05:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 190. [2018-12-09 19:05:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-09 19:05:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 239 transitions. [2018-12-09 19:05:34,119 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 239 transitions. Word has length 66 [2018-12-09 19:05:34,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:34,119 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 239 transitions. [2018-12-09 19:05:34,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:05:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 239 transitions. [2018-12-09 19:05:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:05:34,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:34,119 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:34,120 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:34,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1495120572, now seen corresponding path program 1 times [2018-12-09 19:05:34,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:34,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:34,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:34,360 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 15 treesize of output 12 [2018-12-09 19:05:34,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:05:34,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:05:34,400 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 23 treesize of output 18 [2018-12-09 19:05:34,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,404 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 18 treesize of output 27 [2018-12-09 19:05:34,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:05:34,456 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 32 treesize of output 25 [2018-12-09 19:05:34,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,464 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 25 treesize of output 52 [2018-12-09 19:05:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 19:05:34,537 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 41 treesize of output 32 [2018-12-09 19:05:34,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:05:34,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-09 19:05:34,635 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 50 treesize of output 39 [2018-12-09 19:05:34,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-12-09 19:05:34,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 19:05:34,829 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 59 treesize of output 46 [2018-12-09 19:05:34,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:34,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 175 [2018-12-09 19:05:34,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:34,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-09 19:05:35,014 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 68 treesize of output 53 [2018-12-09 19:05:35,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 232 [2018-12-09 19:05:35,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-09 19:05:35,259 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 77 treesize of output 60 [2018-12-09 19:05:35,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 297 [2018-12-09 19:05:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-09 19:05:35,569 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 86 treesize of output 67 [2018-12-09 19:05:35,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,694 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-12-09 19:05:35,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2018-12-09 19:05:35,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:35,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-09 19:05:35,971 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 93 treesize of output 72 [2018-12-09 19:05:35,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:35,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:36,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:36,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:36,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:36,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:36,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2018-12-09 19:05:36,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-09 19:05:36,391 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 78 treesize of output 56 [2018-12-09 19:05:36,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2018-12-09 19:05:36,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,397 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-09 19:05:36,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-09 19:05:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:05:36,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:36,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:36,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:36,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:36,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:36,786 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-09 19:05:36,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:36,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:05:37,033 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 15 treesize of output 12 [2018-12-09 19:05:37,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:05:37,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:05:37,213 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 23 treesize of output 18 [2018-12-09 19:05:37,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,218 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 18 treesize of output 27 [2018-12-09 19:05:37,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-09 19:05:37,385 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 15 treesize of output 5 [2018-12-09 19:05:37,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,407 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 30 treesize of output 23 [2018-12-09 19:05:37,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,415 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 23 treesize of output 46 [2018-12-09 19:05:37,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,430 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2018-12-09 19:05:37,507 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 41 treesize of output 32 [2018-12-09 19:05:37,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,515 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 32 treesize of output 60 [2018-12-09 19:05:37,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:37,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:37,637 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 41 treesize of output 32 [2018-12-09 19:05:37,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,650 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 32 treesize of output 60 [2018-12-09 19:05:37,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:37,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:37,768 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 41 treesize of output 32 [2018-12-09 19:05:37,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,776 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 32 treesize of output 60 [2018-12-09 19:05:37,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:37,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:37,906 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 41 treesize of output 32 [2018-12-09 19:05:37,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:37,921 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 32 treesize of output 60 [2018-12-09 19:05:37,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:37,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:37,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:38,041 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 41 treesize of output 32 [2018-12-09 19:05:38,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,055 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 32 treesize of output 60 [2018-12-09 19:05:38,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:38,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:38,181 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 41 treesize of output 32 [2018-12-09 19:05:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,197 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 32 treesize of output 60 [2018-12-09 19:05:38,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:38,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:38,322 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 41 treesize of output 32 [2018-12-09 19:05:38,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:38,335 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 32 treesize of output 60 [2018-12-09 19:05:38,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:38,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:38,589 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 29 treesize of output 21 [2018-12-09 19:05:38,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-12-09 19:05:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:38,593 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-09 19:05:38,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-12-09 19:05:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 19:05:38,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:38,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2018-12-09 19:05:38,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 19:05:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 19:05:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 19:05:38,681 INFO L87 Difference]: Start difference. First operand 190 states and 239 transitions. Second operand 42 states. [2018-12-09 19:05:44,123 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-09 19:05:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:44,897 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2018-12-09 19:05:44,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 19:05:44,897 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-12-09 19:05:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:44,898 INFO L225 Difference]: With dead ends: 221 [2018-12-09 19:05:44,898 INFO L226 Difference]: Without dead ends: 221 [2018-12-09 19:05:44,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=507, Invalid=5813, Unknown=0, NotChecked=0, Total=6320 [2018-12-09 19:05:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-09 19:05:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2018-12-09 19:05:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:05:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2018-12-09 19:05:44,902 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 66 [2018-12-09 19:05:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:44,903 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2018-12-09 19:05:44,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 19:05:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2018-12-09 19:05:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:05:44,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:44,903 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:44,903 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:44,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash 895902583, now seen corresponding path program 1 times [2018-12-09 19:05:44,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:44,904 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:45,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:45,132 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 15 treesize of output 12 [2018-12-09 19:05:45,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:05:45,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:05:45,170 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 23 treesize of output 18 [2018-12-09 19:05:45,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,173 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 18 treesize of output 27 [2018-12-09 19:05:45,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:05:45,227 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 32 treesize of output 25 [2018-12-09 19:05:45,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,231 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 25 treesize of output 52 [2018-12-09 19:05:45,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 19:05:45,300 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 41 treesize of output 32 [2018-12-09 19:05:45,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:05:45,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-09 19:05:45,405 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 50 treesize of output 39 [2018-12-09 19:05:45,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-12-09 19:05:45,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 19:05:45,530 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 59 treesize of output 46 [2018-12-09 19:05:45,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 175 [2018-12-09 19:05:45,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-09 19:05:45,709 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 68 treesize of output 53 [2018-12-09 19:05:45,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 232 [2018-12-09 19:05:45,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:45,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-09 19:05:45,897 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 77 treesize of output 60 [2018-12-09 19:05:45,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:45,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 297 [2018-12-09 19:05:45,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-09 19:05:46,191 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 86 treesize of output 67 [2018-12-09 19:05:46,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,312 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-12-09 19:05:46,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2018-12-09 19:05:46,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-09 19:05:46,568 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 93 treesize of output 72 [2018-12-09 19:05:46,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:46,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2018-12-09 19:05:46,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-09 19:05:46,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 78 treesize of output 56 [2018-12-09 19:05:46,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2018-12-09 19:05:46,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:46,976 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-09 19:05:46,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-09 19:05:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:05:47,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:47,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:47,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:47,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:47,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:47,363 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-09 19:05:47,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:05:47,563 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 15 treesize of output 12 [2018-12-09 19:05:47,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:05:47,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:05:47,737 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 23 treesize of output 18 [2018-12-09 19:05:47,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:47,740 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 18 treesize of output 27 [2018-12-09 19:05:47,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:47,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-09 19:05:48,094 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 15 treesize of output 5 [2018-12-09 19:05:48,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,119 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 30 treesize of output 23 [2018-12-09 19:05:48,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,125 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 23 treesize of output 46 [2018-12-09 19:05:48,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2018-12-09 19:05:48,214 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 41 treesize of output 32 [2018-12-09 19:05:48,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,222 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 32 treesize of output 60 [2018-12-09 19:05:48,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:48,351 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 41 treesize of output 32 [2018-12-09 19:05:48,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,359 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 32 treesize of output 60 [2018-12-09 19:05:48,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:48,483 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 41 treesize of output 32 [2018-12-09 19:05:48,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,490 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 32 treesize of output 60 [2018-12-09 19:05:48,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:48,621 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 41 treesize of output 32 [2018-12-09 19:05:48,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,629 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 32 treesize of output 60 [2018-12-09 19:05:48,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:48,763 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 41 treesize of output 32 [2018-12-09 19:05:48,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,772 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 32 treesize of output 60 [2018-12-09 19:05:48,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:48,905 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 41 treesize of output 32 [2018-12-09 19:05:48,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:48,913 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 32 treesize of output 60 [2018-12-09 19:05:48,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:48,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:48,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:49,039 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 41 treesize of output 32 [2018-12-09 19:05:49,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:49,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:49,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:05:49,047 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 32 treesize of output 60 [2018-12-09 19:05:49,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:49,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:49,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:49,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:49,371 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 29 treesize of output 21 [2018-12-09 19:05:49,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-12-09 19:05:49,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:05:49,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:05:49,375 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-09 19:05:49,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-12-09 19:05:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 19:05:49,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:49,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:05:49,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2018-12-09 19:05:49,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 19:05:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 19:05:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1883, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 19:05:49,480 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand 42 states. [2018-12-09 19:05:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:05:55,738 INFO L93 Difference]: Finished difference Result 218 states and 268 transitions. [2018-12-09 19:05:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-09 19:05:55,739 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-12-09 19:05:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:05:55,740 INFO L225 Difference]: With dead ends: 218 [2018-12-09 19:05:55,740 INFO L226 Difference]: Without dead ends: 218 [2018-12-09 19:05:55,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=490, Invalid=5516, Unknown=0, NotChecked=0, Total=6006 [2018-12-09 19:05:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-09 19:05:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2018-12-09 19:05:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-09 19:05:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2018-12-09 19:05:55,745 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 260 transitions. Word has length 67 [2018-12-09 19:05:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:05:55,745 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 260 transitions. [2018-12-09 19:05:55,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 19:05:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 260 transitions. [2018-12-09 19:05:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:05:55,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:05:55,746 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:05:55,746 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:05:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:05:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash -822028470, now seen corresponding path program 1 times [2018-12-09 19:05:55,746 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:05:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:05:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:55,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:05:56,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:56,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-09 19:05:56,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:56,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-09 19:05:56,458 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-09 19:05:56,490 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 2 xjuncts. [2018-12-09 19:05:56,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2018-12-09 19:05:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:05:56,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:05:56,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:05:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:05:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:05:56,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:05:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:05:57,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:05:59,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-09 19:05:59,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:05:59,879 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-09 19:05:59,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-09 19:06:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:00,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:06:00,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 25 [2018-12-09 19:06:00,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 19:06:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 19:06:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=572, Unknown=1, NotChecked=0, Total=650 [2018-12-09 19:06:00,393 INFO L87 Difference]: Start difference. First operand 206 states and 260 transitions. Second operand 26 states. [2018-12-09 19:06:03,883 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-12-09 19:06:04,294 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-09 19:06:04,653 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-09 19:06:04,859 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-09 19:06:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:06,137 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2018-12-09 19:06:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 19:06:06,138 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-12-09 19:06:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:06,139 INFO L225 Difference]: With dead ends: 305 [2018-12-09 19:06:06,139 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 19:06:06,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=457, Invalid=2194, Unknown=1, NotChecked=0, Total=2652 [2018-12-09 19:06:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 19:06:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 210. [2018-12-09 19:06:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-09 19:06:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2018-12-09 19:06:06,143 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 68 [2018-12-09 19:06:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:06,144 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2018-12-09 19:06:06,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 19:06:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2018-12-09 19:06:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:06:06,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:06,144 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:06,144 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:06,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash 286921247, now seen corresponding path program 1 times [2018-12-09 19:06:06,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:06,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:06,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:06,394 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 15 treesize of output 12 [2018-12-09 19:06:06,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:06,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:06:06,471 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-09 19:06:06,472 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-09 19:06:06,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,474 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-09 19:06:06,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 19:06:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:06:06,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-09 19:06:06,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:06,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:06,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:06,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:06,698 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 15 treesize of output 12 [2018-12-09 19:06:06,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:06,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:06:06,733 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-09 19:06:06,735 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-09 19:06:06,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:06,737 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-09 19:06:06,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 19:06:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:06:06,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-09 19:06:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:06:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 13, 8] total 18 [2018-12-09 19:06:06,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:06:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:06:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:06:06,786 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand 19 states. [2018-12-09 19:06:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:08,048 INFO L93 Difference]: Finished difference Result 246 states and 306 transitions. [2018-12-09 19:06:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:06:08,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-09 19:06:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:08,050 INFO L225 Difference]: With dead ends: 246 [2018-12-09 19:06:08,050 INFO L226 Difference]: Without dead ends: 246 [2018-12-09 19:06:08,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 19:06:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-09 19:06:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2018-12-09 19:06:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-09 19:06:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 264 transitions. [2018-12-09 19:06:08,054 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 264 transitions. Word has length 69 [2018-12-09 19:06:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:08,054 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 264 transitions. [2018-12-09 19:06:08,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:06:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 264 transitions. [2018-12-09 19:06:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:06:08,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:08,054 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:08,055 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:08,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash 304624201, now seen corresponding path program 1 times [2018-12-09 19:06:08,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:08,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:08,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:08,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:08,260 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-09 19:06:08,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:06:08,306 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 15 treesize of output 12 [2018-12-09 19:06:08,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:08,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,317 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-09 19:06:08,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-12-09 19:06:08,355 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 1 [2018-12-09 19:06:08,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 19:06:08,389 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 17 treesize of output 13 [2018-12-09 19:06:08,390 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 13 treesize of output 5 [2018-12-09 19:06:08,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,392 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-09 19:06:08,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 19:06:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:08,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:08,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:08,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:08,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:08,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:08,701 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-09 19:06:08,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 19:06:08,707 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 15 treesize of output 12 [2018-12-09 19:06:08,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:08,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,721 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-09 19:06:08,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-12-09 19:06:08,723 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 9 treesize of output 1 [2018-12-09 19:06:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-09 19:06:08,727 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 17 treesize of output 13 [2018-12-09 19:06:08,729 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 13 treesize of output 5 [2018-12-09 19:06:08,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:08,742 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-09 19:06:08,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-09 19:06:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:08,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:08,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:06:08,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 14, 9] total 20 [2018-12-09 19:06:08,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 19:06:08,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 19:06:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:06:08,869 INFO L87 Difference]: Start difference. First operand 212 states and 264 transitions. Second operand 21 states. [2018-12-09 19:06:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:17,171 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2018-12-09 19:06:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 19:06:17,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2018-12-09 19:06:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:17,172 INFO L225 Difference]: With dead ends: 277 [2018-12-09 19:06:17,173 INFO L226 Difference]: Without dead ends: 277 [2018-12-09 19:06:17,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 19:06:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-09 19:06:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 232. [2018-12-09 19:06:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 19:06:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 294 transitions. [2018-12-09 19:06:17,176 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 294 transitions. Word has length 70 [2018-12-09 19:06:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:17,177 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 294 transitions. [2018-12-09 19:06:17,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 19:06:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 294 transitions. [2018-12-09 19:06:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:06:17,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:17,177 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:17,177 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:17,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 907133097, now seen corresponding path program 1 times [2018-12-09 19:06:17,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:17,178 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:17,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:17,542 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 6 treesize of output 5 [2018-12-09 19:06:17,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 19:06:17,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 19:06:17,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:17,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 19:06:17,636 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 23 treesize of output 18 [2018-12-09 19:06:17,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,639 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 18 treesize of output 27 [2018-12-09 19:06:17,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-09 19:06:17,702 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-09 19:06:17,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,706 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 25 treesize of output 52 [2018-12-09 19:06:17,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-09 19:06:17,796 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 41 treesize of output 32 [2018-12-09 19:06:17,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:06:17,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-09 19:06:17,915 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 50 treesize of output 39 [2018-12-09 19:06:17,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:17,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-12-09 19:06:17,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:17,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-12-09 19:06:18,055 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 59 treesize of output 46 [2018-12-09 19:06:18,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 175 [2018-12-09 19:06:18,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-12-09 19:06:18,240 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 68 treesize of output 53 [2018-12-09 19:06:18,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 232 [2018-12-09 19:06:18,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-12-09 19:06:18,444 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 77 treesize of output 60 [2018-12-09 19:06:18,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 297 [2018-12-09 19:06:18,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2018-12-09 19:06:18,691 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 86 treesize of output 67 [2018-12-09 19:06:18,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:18,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2018-12-09 19:06:18,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:18,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:99 [2018-12-09 19:06:19,004 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 93 treesize of output 72 [2018-12-09 19:06:19,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,158 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-12-09 19:06:19,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2018-12-09 19:06:19,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:112, output treesize:101 [2018-12-09 19:06:19,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2018-12-09 19:06:19,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2018-12-09 19:06:19,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:15 [2018-12-09 19:06:19,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:19,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 19:06:19,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:19,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 19:06:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:06:19,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:20,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:20,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:20,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:20,178 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 6 treesize of output 5 [2018-12-09 19:06:20,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 19:06:20,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 19:06:20,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:20,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 19:06:20,552 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 23 treesize of output 18 [2018-12-09 19:06:20,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,555 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 18 treesize of output 27 [2018-12-09 19:06:20,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-09 19:06:20,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-12-09 19:06:20,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,780 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-09 19:06:20,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,784 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 25 treesize of output 52 [2018-12-09 19:06:20,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:20,804 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:38 [2018-12-09 19:06:20,978 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 41 treesize of output 32 [2018-12-09 19:06:20,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:20,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:06:20,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 19:06:21,227 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 50 treesize of output 39 [2018-12-09 19:06:21,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-12-09 19:06:21,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-12-09 19:06:21,499 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 57 treesize of output 44 [2018-12-09 19:06:21,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 163 [2018-12-09 19:06:21,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2018-12-09 19:06:21,678 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 68 treesize of output 53 [2018-12-09 19:06:21,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 177 [2018-12-09 19:06:21,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:21,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-09 19:06:21,906 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 68 treesize of output 53 [2018-12-09 19:06:21,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:21,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 177 [2018-12-09 19:06:21,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:21,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:21,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-09 19:06:22,128 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 68 treesize of output 53 [2018-12-09 19:06:22,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 177 [2018-12-09 19:06:22,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:22,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-09 19:06:22,349 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 68 treesize of output 53 [2018-12-09 19:06:22,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:22,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 177 [2018-12-09 19:06:22,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:22,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-12-09 19:06:22,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2018-12-09 19:06:22,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 3 [2018-12-09 19:06:22,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:22,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:13 [2018-12-09 19:06:23,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:23,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-09 19:06:23,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:23,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:23,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 19:06:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 19:06:23,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:23,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-09 19:06:23,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:23,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:23,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:12 [2018-12-09 19:06:23,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:06:23,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 50 [2018-12-09 19:06:23,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-09 19:06:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-09 19:06:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3407, Unknown=7, NotChecked=0, Total=3660 [2018-12-09 19:06:23,467 INFO L87 Difference]: Start difference. First operand 232 states and 294 transitions. Second operand 51 states. [2018-12-09 19:06:32,118 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2018-12-09 19:06:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:34,333 INFO L93 Difference]: Finished difference Result 269 states and 329 transitions. [2018-12-09 19:06:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 19:06:34,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 70 [2018-12-09 19:06:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:34,334 INFO L225 Difference]: With dead ends: 269 [2018-12-09 19:06:34,334 INFO L226 Difference]: Without dead ends: 269 [2018-12-09 19:06:34,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 113 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2716 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=636, Invalid=8477, Unknown=7, NotChecked=0, Total=9120 [2018-12-09 19:06:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-09 19:06:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 235. [2018-12-09 19:06:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-09 19:06:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2018-12-09 19:06:34,338 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 70 [2018-12-09 19:06:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:34,338 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2018-12-09 19:06:34,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-09 19:06:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2018-12-09 19:06:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:06:34,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:34,339 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:34,339 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:34,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 907133098, now seen corresponding path program 1 times [2018-12-09 19:06:34,339 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:34,339 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:34,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:34,524 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-09 19:06:34,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:34,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:34,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:06:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:06:34,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:37,472 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 19:06:37,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:37,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:37,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:37,541 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-09 19:06:37,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:37,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:37,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:06:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:06:37,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:39,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:06:39,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 19:06:39,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:06:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:06:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:06:39,265 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand 11 states. [2018-12-09 19:06:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:40,178 INFO L93 Difference]: Finished difference Result 272 states and 329 transitions. [2018-12-09 19:06:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:06:40,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-12-09 19:06:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:40,179 INFO L225 Difference]: With dead ends: 272 [2018-12-09 19:06:40,180 INFO L226 Difference]: Without dead ends: 272 [2018-12-09 19:06:40,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:06:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-09 19:06:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2018-12-09 19:06:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-09 19:06:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-12-09 19:06:40,184 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 70 [2018-12-09 19:06:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:40,184 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-12-09 19:06:40,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:06:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-12-09 19:06:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:06:40,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:40,185 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:40,185 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:40,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -104200024, now seen corresponding path program 2 times [2018-12-09 19:06:40,186 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:40,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:40,199 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 19:06:40,354 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-09 19:06:40,354 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 19:06:40,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 19:06:40,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:06:40,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:06:40,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:06:40,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-09 19:06:40,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:06:40,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:06:40,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:06:40,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:06:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:06:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:06:40,450 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 5 states. [2018-12-09 19:06:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:40,470 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-12-09 19:06:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:06:40,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 19:06:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:40,471 INFO L225 Difference]: With dead ends: 177 [2018-12-09 19:06:40,471 INFO L226 Difference]: Without dead ends: 177 [2018-12-09 19:06:40,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:06:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-09 19:06:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2018-12-09 19:06:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-09 19:06:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-12-09 19:06:40,475 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 70 [2018-12-09 19:06:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:40,475 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-12-09 19:06:40,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:06:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2018-12-09 19:06:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:06:40,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:40,475 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:40,476 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:40,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -531041507, now seen corresponding path program 1 times [2018-12-09 19:06:40,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:40,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:06:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:40,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:06:40,666 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:06:40,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:06:40,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:06:40,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:06:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:06:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:06:40,669 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 5 states. [2018-12-09 19:06:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:40,722 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-12-09 19:06:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:06:40,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 19:06:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:40,724 INFO L225 Difference]: With dead ends: 165 [2018-12-09 19:06:40,724 INFO L226 Difference]: Without dead ends: 161 [2018-12-09 19:06:40,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:06:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-09 19:06:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2018-12-09 19:06:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-09 19:06:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-12-09 19:06:40,726 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 71 [2018-12-09 19:06:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:40,726 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-12-09 19:06:40,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:06:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-12-09 19:06:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:06:40,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:40,727 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:40,727 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:40,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1943645070, now seen corresponding path program 1 times [2018-12-09 19:06:40,727 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:40,727 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:40,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:41,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:41,128 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 15 treesize of output 12 [2018-12-09 19:06:41,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:41,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:06:41,173 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 25 treesize of output 20 [2018-12-09 19:06:41,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-09 19:06:41,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 19:06:41,243 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 34 treesize of output 27 [2018-12-09 19:06:41,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,248 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 27 treesize of output 58 [2018-12-09 19:06:41,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-09 19:06:41,324 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 43 treesize of output 34 [2018-12-09 19:06:41,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-12-09 19:06:41,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-09 19:06:41,446 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 52 treesize of output 41 [2018-12-09 19:06:41,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 136 [2018-12-09 19:06:41,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-09 19:06:41,592 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 61 treesize of output 48 [2018-12-09 19:06:41,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 187 [2018-12-09 19:06:41,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-12-09 19:06:41,792 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 70 treesize of output 55 [2018-12-09 19:06:41,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:41,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 246 [2018-12-09 19:06:41,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:41,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-12-09 19:06:42,054 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 79 treesize of output 62 [2018-12-09 19:06:42,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 313 [2018-12-09 19:06:42,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-12-09 19:06:42,384 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 86 treesize of output 67 [2018-12-09 19:06:42,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:42,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2018-12-09 19:06:42,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:85 [2018-12-09 19:06:42,823 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 71 treesize of output 51 [2018-12-09 19:06:42,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 3 [2018-12-09 19:06:42,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:42,828 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-09 19:06:42,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:3 [2018-12-09 19:06:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:06:42,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:43,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:43,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:43,391 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-09 19:06:43,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:06:43,670 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 15 treesize of output 12 [2018-12-09 19:06:43,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:43,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:06:43,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-12-09 19:06:43,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,847 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 25 treesize of output 20 [2018-12-09 19:06:43,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,850 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 20 treesize of output 31 [2018-12-09 19:06:43,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,863 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:27 [2018-12-09 19:06:43,868 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 34 treesize of output 27 [2018-12-09 19:06:43,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-09 19:06:43,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-12-09 19:06:43,897 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 41 treesize of output 32 [2018-12-09 19:06:43,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:43,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:06:43,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:43,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 19:06:44,029 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 52 treesize of output 41 [2018-12-09 19:06:44,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-12-09 19:06:44,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:44,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 19:06:44,207 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 52 treesize of output 41 [2018-12-09 19:06:44,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-12-09 19:06:44,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:44,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 19:06:44,395 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 52 treesize of output 41 [2018-12-09 19:06:44,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-12-09 19:06:44,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:44,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 19:06:44,594 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 52 treesize of output 41 [2018-12-09 19:06:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-12-09 19:06:44,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:44,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 19:06:44,780 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 52 treesize of output 41 [2018-12-09 19:06:44,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:44,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 96 [2018-12-09 19:06:44,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:44,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:44,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-12-09 19:06:45,426 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 36 treesize of output 26 [2018-12-09 19:06:45,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-12-09 19:06:45,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:45,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:45,430 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-09 19:06:45,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:3 [2018-12-09 19:06:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 19:06:45,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:06:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 41 [2018-12-09 19:06:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 19:06:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 19:06:45,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 19:06:45,549 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 42 states. [2018-12-09 19:06:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:06:52,297 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-12-09 19:06:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-09 19:06:52,297 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 71 [2018-12-09 19:06:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:06:52,298 INFO L225 Difference]: With dead ends: 161 [2018-12-09 19:06:52,298 INFO L226 Difference]: Without dead ends: 161 [2018-12-09 19:06:52,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=520, Invalid=6286, Unknown=0, NotChecked=0, Total=6806 [2018-12-09 19:06:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-09 19:06:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2018-12-09 19:06:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-09 19:06:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2018-12-09 19:06:52,301 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 71 [2018-12-09 19:06:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:06:52,301 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2018-12-09 19:06:52,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 19:06:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2018-12-09 19:06:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:06:52,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:06:52,302 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:06:52,302 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:06:52,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:06:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash -123454967, now seen corresponding path program 1 times [2018-12-09 19:06:52,302 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:06:52,302 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:06:52,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:52,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:52,705 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 15 treesize of output 12 [2018-12-09 19:06:52,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:52,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 19:06:52,744 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 23 treesize of output 18 [2018-12-09 19:06:52,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,746 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 18 treesize of output 27 [2018-12-09 19:06:52,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:06:52,799 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 32 treesize of output 25 [2018-12-09 19:06:52,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,805 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 25 treesize of output 52 [2018-12-09 19:06:52,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 19:06:52,883 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 41 treesize of output 32 [2018-12-09 19:06:52,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:52,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-12-09 19:06:52,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:52,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-09 19:06:53,007 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 50 treesize of output 39 [2018-12-09 19:06:53,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-12-09 19:06:53,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 19:06:53,181 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 59 treesize of output 46 [2018-12-09 19:06:53,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 175 [2018-12-09 19:06:53,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-12-09 19:06:53,391 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 68 treesize of output 53 [2018-12-09 19:06:53,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 232 [2018-12-09 19:06:53,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-12-09 19:06:53,591 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 77 treesize of output 60 [2018-12-09 19:06:53,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 297 [2018-12-09 19:06:53,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-12-09 19:06:53,826 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 86 treesize of output 67 [2018-12-09 19:06:53,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:53,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 370 [2018-12-09 19:06:53,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:53,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:88 [2018-12-09 19:06:54,115 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 93 treesize of output 72 [2018-12-09 19:06:54,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:54,301 INFO L303 Elim1Store]: Index analysis took 184 ms [2018-12-09 19:06:54,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 431 [2018-12-09 19:06:54,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:54,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:54,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:54,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2018-12-09 19:06:54,767 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 78 treesize of output 56 [2018-12-09 19:06:54,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 3 [2018-12-09 19:06:54,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:54,771 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-09 19:06:54,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2018-12-09 19:06:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 19:06:54,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:55,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:06:55,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:06:55,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:06:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:06:55,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:06:55,324 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-09 19:06:55,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:06:55,613 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 15 treesize of output 12 [2018-12-09 19:06:55,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:06:55,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-09 19:06:55,787 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 15 treesize of output 5 [2018-12-09 19:06:55,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,803 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 23 treesize of output 18 [2018-12-09 19:06:55,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:55,805 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 18 treesize of output 27 [2018-12-09 19:06:55,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,817 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:22 [2018-12-09 19:06:55,885 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 34 treesize of output 27 [2018-12-09 19:06:55,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:55,890 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:55,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:55,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,006 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 34 treesize of output 27 [2018-12-09 19:06:56,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,012 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,126 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 34 treesize of output 27 [2018-12-09 19:06:56,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,131 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,251 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 34 treesize of output 27 [2018-12-09 19:06:56,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,256 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,373 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 34 treesize of output 27 [2018-12-09 19:06:56,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,380 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,519 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 34 treesize of output 27 [2018-12-09 19:06:56,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,525 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:56,647 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 34 treesize of output 27 [2018-12-09 19:06:56,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:06:56,652 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:06:56,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:56,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:06:56,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 19:06:57,056 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 22 treesize of output 16 [2018-12-09 19:06:57,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 19:06:57,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:06:57,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:06:57,060 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-09 19:06:57,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-09 19:06:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 19:06:57,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:06:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:06:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 42 [2018-12-09 19:06:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-09 19:06:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-09 19:06:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 19:06:57,171 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand 43 states. [2018-12-09 19:07:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:03,806 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-12-09 19:07:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 19:07:03,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 72 [2018-12-09 19:07:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:03,808 INFO L225 Difference]: With dead ends: 160 [2018-12-09 19:07:03,808 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 19:07:03,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=512, Invalid=6130, Unknown=0, NotChecked=0, Total=6642 [2018-12-09 19:07:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 19:07:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2018-12-09 19:07:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-09 19:07:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-12-09 19:07:03,810 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 72 [2018-12-09 19:07:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:03,810 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-12-09 19:07:03,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-09 19:07:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-12-09 19:07:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:07:03,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:03,811 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:03,811 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:03,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -206187708, now seen corresponding path program 1 times [2018-12-09 19:07:03,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:03,812 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:03,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-12-09 19:07:04,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-12-09 19:07:04,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:04,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-12-09 19:07:04,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-12-09 19:07:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:07:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 7] total 13 [2018-12-09 19:07:04,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:07:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:07:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:07:04,194 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 13 states. [2018-12-09 19:07:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:04,370 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-12-09 19:07:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:07:04,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-12-09 19:07:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:04,371 INFO L225 Difference]: With dead ends: 158 [2018-12-09 19:07:04,371 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 19:07:04,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:07:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 19:07:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-12-09 19:07:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-09 19:07:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2018-12-09 19:07:04,374 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 73 [2018-12-09 19:07:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:04,375 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2018-12-09 19:07:04,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:07:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2018-12-09 19:07:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:07:04,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:04,375 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:04,376 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:04,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1166492377, now seen corresponding path program 2 times [2018-12-09 19:07:04,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:04,411 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:04,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:04,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:04,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:04,806 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-09 19:07:04,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:04,816 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-09 19:07:04,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:04,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:04,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:07:06,113 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-09 19:07:06,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:07:06,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 19:07:06,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 19:07:06,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:07:06,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,217 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-09 19:07:06,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-09 19:07:06,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:07:06,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,317 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-09 19:07:06,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:07:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 157 trivial. 6 not checked. [2018-12-09 19:07:06,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:06,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:06,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:06,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:06,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:06,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:06,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:06,802 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-09 19:07:06,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,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 6 treesize of output 5 [2018-12-09 19:07:06,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 19:07:06,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,827 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-09 19:07:06,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:07:06,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:07:06,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,863 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-09 19:07:06,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:07:06,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-09 19:07:06,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 19:07:06,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:06,949 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-09 19:07:06,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:06,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-09 19:07:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 157 trivial. 6 not checked. [2018-12-09 19:07:06,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:07,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:07:07,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-12-09 19:07:07,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:07:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:07:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2018-12-09 19:07:07,205 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 16 states. [2018-12-09 19:07:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:08,406 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-12-09 19:07:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:07:08,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-12-09 19:07:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:08,406 INFO L225 Difference]: With dead ends: 187 [2018-12-09 19:07:08,407 INFO L226 Difference]: Without dead ends: 187 [2018-12-09 19:07:08,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=477, Unknown=1, NotChecked=44, Total=600 [2018-12-09 19:07:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-09 19:07:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 155. [2018-12-09 19:07:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-09 19:07:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-12-09 19:07:08,409 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 76 [2018-12-09 19:07:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-12-09 19:07:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:07:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-12-09 19:07:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:07:08,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:08,410 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:08,410 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:08,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1354856233, now seen corresponding path program 2 times [2018-12-09 19:07:08,410 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:08,410 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:08,585 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-09 19:07:08,586 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 19:07:08,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 19:07:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:08,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:08,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:08,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:08,699 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 6 treesize of output 5 [2018-12-09 19:07:08,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 19:07:08,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 19:07:08,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:07:08,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 19:07:08,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-09 19:07:08,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,854 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 23 treesize of output 18 [2018-12-09 19:07:08,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:08,856 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 18 treesize of output 27 [2018-12-09 19:07:08,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,868 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:26 [2018-12-09 19:07:08,895 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 34 treesize of output 27 [2018-12-09 19:07:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:08,900 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:08,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:08,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:08,949 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 34 treesize of output 27 [2018-12-09 19:07:08,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:08,955 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:08,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:08,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:08,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,006 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 34 treesize of output 27 [2018-12-09 19:07:09,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,011 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:09,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:09,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,061 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 34 treesize of output 27 [2018-12-09 19:07:09,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,066 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:09,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:09,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,114 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 34 treesize of output 27 [2018-12-09 19:07:09,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,119 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:09,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:09,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,167 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 34 treesize of output 27 [2018-12-09 19:07:09,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,172 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 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:09,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:09,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,222 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 34 treesize of output 27 [2018-12-09 19:07:09,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-12-09 19:07:09,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:09,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-12-09 19:07:09,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 19:07:09,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 19:07:09,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:13 [2018-12-09 19:07:09,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:09,410 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-09 19:07:09,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 19:07:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 19:07:09,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:09,513 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 6 treesize of output 1 [2018-12-09 19:07:09,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:09,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:12 [2018-12-09 19:07:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:07:09,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-09 19:07:09,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:07:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:07:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-12-09 19:07:09,811 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 18 states. [2018-12-09 19:07:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:11,652 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-12-09 19:07:11,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:07:11,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-12-09 19:07:11,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:11,653 INFO L225 Difference]: With dead ends: 174 [2018-12-09 19:07:11,653 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 19:07:11,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=1679, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 19:07:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 19:07:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-12-09 19:07:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 19:07:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2018-12-09 19:07:11,655 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 75 [2018-12-09 19:07:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:11,655 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2018-12-09 19:07:11,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:07:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2018-12-09 19:07:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 19:07:11,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:11,656 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:11,656 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:11,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1354856232, now seen corresponding path program 2 times [2018-12-09 19:07:11,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 58 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:11,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:11,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:11,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:11,870 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-09 19:07:11,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:11,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:11,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:07:12,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:14,983 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 19:07:15,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:15,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:15,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:15,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:15,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:15,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:15,061 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-09 19:07:15,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:15,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:15,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:07:15,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:15,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:07:15,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 19:07:15,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:07:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:07:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:07:15,482 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 12 states. [2018-12-09 19:07:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:16,474 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-12-09 19:07:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:07:16,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-12-09 19:07:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:16,475 INFO L225 Difference]: With dead ends: 174 [2018-12-09 19:07:16,476 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 19:07:16,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:07:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 19:07:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-12-09 19:07:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 19:07:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-12-09 19:07:16,479 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 75 [2018-12-09 19:07:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:16,479 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-12-09 19:07:16,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:07:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-12-09 19:07:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:07:16,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:16,480 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:16,480 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1933234001, now seen corresponding path program 1 times [2018-12-09 19:07:16,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 60 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:16,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:07:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:16,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:16,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:16,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:16,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:16,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:16,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:16,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:07:16,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 19:07:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:07:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:07:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:07:16,924 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 9 states. [2018-12-09 19:07:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:17,015 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2018-12-09 19:07:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:07:17,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-12-09 19:07:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:17,017 INFO L225 Difference]: With dead ends: 175 [2018-12-09 19:07:17,017 INFO L226 Difference]: Without dead ends: 171 [2018-12-09 19:07:17,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:07:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-09 19:07:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2018-12-09 19:07:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-09 19:07:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 180 transitions. [2018-12-09 19:07:17,019 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 180 transitions. Word has length 76 [2018-12-09 19:07:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:17,019 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 180 transitions. [2018-12-09 19:07:17,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:07:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 180 transitions. [2018-12-09 19:07:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 19:07:17,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:17,019 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:17,019 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:17,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 949129732, now seen corresponding path program 2 times [2018-12-09 19:07:17,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:17,042 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:17,253 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-09 19:07:17,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 19:07:17,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 19:07:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:17,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:17,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:17,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:17,383 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-09 19:07:17,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:17,460 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-09 19:07:17,461 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-09 19:07:17,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2018-12-09 19:07:17,495 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 25 treesize of output 20 [2018-12-09 19:07:17,499 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 20 treesize of output 21 [2018-12-09 19:07:17,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,544 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 25 treesize of output 20 [2018-12-09 19:07:17,547 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 20 treesize of output 21 [2018-12-09 19:07:17,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,589 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 25 treesize of output 20 [2018-12-09 19:07:17,593 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 20 treesize of output 21 [2018-12-09 19:07:17,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,636 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 25 treesize of output 20 [2018-12-09 19:07:17,639 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 20 treesize of output 21 [2018-12-09 19:07:17,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,682 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 25 treesize of output 20 [2018-12-09 19:07:17,686 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 20 treesize of output 21 [2018-12-09 19:07:17,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,733 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 25 treesize of output 20 [2018-12-09 19:07:17,738 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 20 treesize of output 21 [2018-12-09 19:07:17,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:17,789 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 25 treesize of output 20 [2018-12-09 19:07:17,793 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 20 treesize of output 21 [2018-12-09 19:07:17,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:17,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:17,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:18,034 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 13 treesize of output 1 [2018-12-09 19:07:18,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:18,041 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-09 19:07:18,043 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-09 19:07:18,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:18,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:18,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:18,046 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-12-09 19:07:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 1 proven. 82 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 19:07:18,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:18,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:07:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-09 19:07:18,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:07:18,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:07:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=494, Unknown=2, NotChecked=0, Total=552 [2018-12-09 19:07:18,730 INFO L87 Difference]: Start difference. First operand 159 states and 180 transitions. Second operand 18 states. [2018-12-09 19:07:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:20,594 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-12-09 19:07:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 19:07:20,595 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-12-09 19:07:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:20,596 INFO L225 Difference]: With dead ends: 174 [2018-12-09 19:07:20,596 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 19:07:20,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=210, Invalid=1594, Unknown=2, NotChecked=0, Total=1806 [2018-12-09 19:07:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 19:07:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-12-09 19:07:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-09 19:07:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-12-09 19:07:20,598 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 76 [2018-12-09 19:07:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-12-09 19:07:20,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:07:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-12-09 19:07:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:07:20,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:20,599 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:20,599 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:20,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:20,599 INFO L82 PathProgramCache]: Analyzing trace with hash -641749321, now seen corresponding path program 2 times [2018-12-09 19:07:20,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:20,600 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 64 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:20,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:20,805 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-09 19:07:20,805 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 19:07:20,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 19:07:20,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 19:07:20,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 19:07:20,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:07:20,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:20,936 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-09 19:07:20,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:20,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:20,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:21,011 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-09 19:07:21,013 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-09 19:07:21,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:20 [2018-12-09 19:07:21,051 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 25 treesize of output 20 [2018-12-09 19:07:21,055 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 20 treesize of output 21 [2018-12-09 19:07:21,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,105 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 25 treesize of output 20 [2018-12-09 19:07:21,109 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 20 treesize of output 21 [2018-12-09 19:07:21,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,157 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 25 treesize of output 20 [2018-12-09 19:07:21,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-12-09 19:07:21,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,208 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 25 treesize of output 20 [2018-12-09 19:07:21,213 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 20 treesize of output 21 [2018-12-09 19:07:21,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,256 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 25 treesize of output 20 [2018-12-09 19:07:21,260 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 20 treesize of output 21 [2018-12-09 19:07:21,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,308 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 25 treesize of output 20 [2018-12-09 19:07:21,313 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 20 treesize of output 21 [2018-12-09 19:07:21,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,360 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 25 treesize of output 20 [2018-12-09 19:07:21,365 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 20 treesize of output 21 [2018-12-09 19:07:21,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:21,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 19:07:21,584 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 13 treesize of output 1 [2018-12-09 19:07:21,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,589 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-09 19:07:21,591 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-09 19:07:21,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:21,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-12-09 19:07:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 1 proven. 84 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 19:07:21,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:22,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:07:22,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-12-09 19:07:22,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:07:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:07:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=495, Unknown=1, NotChecked=0, Total=552 [2018-12-09 19:07:22,277 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 18 states. [2018-12-09 19:07:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:24,069 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2018-12-09 19:07:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:07:24,070 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-12-09 19:07:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:24,070 INFO L225 Difference]: With dead ends: 173 [2018-12-09 19:07:24,070 INFO L226 Difference]: Without dead ends: 173 [2018-12-09 19:07:24,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=1317, Unknown=1, NotChecked=0, Total=1482 [2018-12-09 19:07:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-09 19:07:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-12-09 19:07:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-09 19:07:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-12-09 19:07:24,072 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 77 [2018-12-09 19:07:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:24,073 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-12-09 19:07:24,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:07:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-12-09 19:07:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:07:24,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:24,073 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:24,073 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:24,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1579213306, now seen corresponding path program 1 times [2018-12-09 19:07:24,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 66 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:24,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:07:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:24,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:24,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:24,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:24,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:24,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:24,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-09 19:07:24,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:07:24,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 11 [2018-12-09 19:07:24,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:07:24,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:07:24,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:07:24,516 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 11 states. [2018-12-09 19:07:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:24,636 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2018-12-09 19:07:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:07:24,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-12-09 19:07:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:24,637 INFO L225 Difference]: With dead ends: 187 [2018-12-09 19:07:24,637 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 19:07:24,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:07:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 19:07:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2018-12-09 19:07:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-09 19:07:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2018-12-09 19:07:24,639 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 78 [2018-12-09 19:07:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:24,640 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2018-12-09 19:07:24,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:07:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2018-12-09 19:07:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:07:24,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:24,640 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:24,640 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:24,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:24,640 INFO L82 PathProgramCache]: Analyzing trace with hash 329587573, now seen corresponding path program 1 times [2018-12-09 19:07:24,641 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:24,641 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:24,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:24,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:24,870 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-09 19:07:24,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:24,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:24,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:24,966 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 15 treesize of output 12 [2018-12-09 19:07:24,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:07:24,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:24,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:24,986 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-09 19:07:24,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-09 19:07:25,049 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 9 treesize of output 1 [2018-12-09 19:07:25,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,054 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-09 19:07:25,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-12-09 19:07:25,094 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 17 treesize of output 13 [2018-12-09 19:07:25,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 19:07:25,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-12-09 19:07:25,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:25,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:07:25,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:07:25,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:25,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-09 19:07:25,153 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_alloc_unsafe_17_#in~array.base|))) (or (and (= (_ bv1 1) .cse0) (exists ((|v_alloc_unsafe_17_#t~mem41.base_13| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_alloc_unsafe_17_#t~mem41.base_13|)) (= (_ bv0 1) (select |c_#valid| |v_alloc_unsafe_17_#t~mem41.base_13|))))) (and (= (_ bv0 1) .cse0) (= (_ bv0 1) (select |c_old(#valid)| |c_alloc_unsafe_17_#in~array.base|))))) is different from true [2018-12-09 19:07:25,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:25,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:25,159 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 23 treesize of output 15 [2018-12-09 19:07:25,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,169 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-09 19:07:25,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-09 19:07:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 1 not checked. [2018-12-09 19:07:25,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:25,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 19:07:25,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:6 [2018-12-09 19:07:25,855 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 6 treesize of output 1 [2018-12-09 19:07:25,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:25,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:25,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-12-09 19:07:26,000 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 12 treesize of output 7 [2018-12-09 19:07:26,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,002 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 4 [2018-12-09 19:07:26,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:07:26,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:22 [2018-12-09 19:07:26,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:26,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:26,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:26,247 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-09 19:07:26,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:07:26,260 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 15 treesize of output 12 [2018-12-09 19:07:26,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:07:26,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,279 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-09 19:07:26,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-12-09 19:07:26,281 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 9 treesize of output 1 [2018-12-09 19:07:26,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,285 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 7 treesize of output 1 [2018-12-09 19:07:26,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-12-09 19:07:26,289 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 17 treesize of output 13 [2018-12-09 19:07:26,291 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 13 treesize of output 5 [2018-12-09 19:07:26,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-12-09 19:07:26,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:26,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 19:07:26,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 19:07:26,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:26,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:28 [2018-12-09 19:07:26,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_alloc_unsafe_17_#in~array.base|))) (or (and (= (_ bv1 1) .cse0) (exists ((|v_alloc_unsafe_17_#t~mem41.base_20| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_alloc_unsafe_17_#t~mem41.base_20|)) (= (_ bv0 1) (select |c_#valid| |v_alloc_unsafe_17_#t~mem41.base_20|))))) (and (= (_ bv0 1) .cse0) (= (_ bv0 1) (select |c_old(#valid)| |c_alloc_unsafe_17_#in~array.base|))))) is different from true [2018-12-09 19:07:26,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:26,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:07:26,325 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 23 treesize of output 15 [2018-12-09 19:07:26,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,335 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-09 19:07:26,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-09 19:07:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 1 not checked. [2018-12-09 19:07:26,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:26,580 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 6 treesize of output 1 [2018-12-09 19:07:26,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-09 19:07:26,641 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 6 treesize of output 1 [2018-12-09 19:07:26,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:26,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:26,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-12-09 19:07:30,748 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 12 treesize of output 7 [2018-12-09 19:07:30,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:30,749 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 4 [2018-12-09 19:07:30,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:30,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:07:30,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:22 [2018-12-09 19:07:30,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:07:30,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-12-09 19:07:30,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:07:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:07:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=783, Unknown=4, NotChecked=114, Total=992 [2018-12-09 19:07:30,846 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand 19 states. [2018-12-09 19:07:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:34,250 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2018-12-09 19:07:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:07:34,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-12-09 19:07:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:34,250 INFO L225 Difference]: With dead ends: 183 [2018-12-09 19:07:34,251 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 19:07:34,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=151, Invalid=1259, Unknown=4, NotChecked=146, Total=1560 [2018-12-09 19:07:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 19:07:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2018-12-09 19:07:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-09 19:07:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2018-12-09 19:07:34,253 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 80 [2018-12-09 19:07:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:34,253 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2018-12-09 19:07:34,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:07:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2018-12-09 19:07:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:07:34,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:34,253 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:34,253 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 329587574, now seen corresponding path program 1 times [2018-12-09 19:07:34,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:34,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 70 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:34,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:34,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-09 19:07:34,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:34,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 19:07:34,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:34,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-09 19:07:34,911 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-09 19:07:34,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:34,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-09 19:07:35,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 19:07:35,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:35,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:35,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:54 [2018-12-09 19:07:35,451 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-09 19:07:35,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:35,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:35,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-09 19:07:35,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:35,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-12-09 19:07:35,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:07:35,681 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-09 19:07:35,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 19:07:36,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-12-09 19:07:36,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 19:07:36,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-09 19:07:36,141 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-09 19:07:36,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 19:07:36,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:83 [2018-12-09 19:07:36,492 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2018-12-09 19:07:36,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:07:36,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-09 19:07:36,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:07:36,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:07:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:07:36,512 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand 12 states. [2018-12-09 19:07:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:37,386 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2018-12-09 19:07:37,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:07:37,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-12-09 19:07:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:37,386 INFO L225 Difference]: With dead ends: 201 [2018-12-09 19:07:37,386 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 19:07:37,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:07:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 19:07:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-12-09 19:07:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-09 19:07:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2018-12-09 19:07:37,389 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 80 [2018-12-09 19:07:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:37,389 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2018-12-09 19:07:37,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:07:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2018-12-09 19:07:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:07:37,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:37,390 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:37,390 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:37,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1627280166, now seen corresponding path program 1 times [2018-12-09 19:07:37,391 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 72 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:37,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:37,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:37,636 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-09 19:07:37,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:07:37,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:37,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:37,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:37,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 19:07:37,725 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-09 19:07:37,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 19:07:37,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:37,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:37,728 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-09 19:07:37,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 19:07:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-09 19:07:37,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:38,016 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 7 treesize of output 5 [2018-12-09 19:07:38,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 19:07:38,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 19:07:38,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-12-09 19:07:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 19:07:38,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:07:38,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:07:38,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:07:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:07:38,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:07:38,357 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-09 19:07:38,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:07:38,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 19:07:38,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-09 19:07:38,407 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-09 19:07:38,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,409 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-09 19:07:38,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 19:07:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-09 19:07:38,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:07:38,513 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 7 treesize of output 5 [2018-12-09 19:07:38,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 19:07:38,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:07:38,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 19:07:38,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-12-09 19:07:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 19:07:38,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 19:07:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13, 10] total 19 [2018-12-09 19:07:38,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 19:07:38,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 19:07:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:07:38,572 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 20 states. [2018-12-09 19:07:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:07:43,509 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-12-09 19:07:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:07:43,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-12-09 19:07:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:07:43,511 INFO L225 Difference]: With dead ends: 217 [2018-12-09 19:07:43,511 INFO L226 Difference]: Without dead ends: 217 [2018-12-09 19:07:43,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 301 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:07:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-09 19:07:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2018-12-09 19:07:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-09 19:07:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2018-12-09 19:07:43,513 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 81 [2018-12-09 19:07:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:07:43,513 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2018-12-09 19:07:43,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 19:07:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2018-12-09 19:07:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:07:43,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:07:43,514 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:07:43,514 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:07:43,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:07:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1454527127, now seen corresponding path program 3 times [2018-12-09 19:07:43,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:07:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:07:43,530 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 19:07:43,592 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-09 19:07:43,592 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-09 19:07:43,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-09 19:07:43,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:08:30,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-09 19:08:30,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:08:30,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:08:30,115 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 6 treesize of output 5 [2018-12-09 19:08:30,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 19:08:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 19:08:30,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 10 treesize of output 9 [2018-12-09 19:08:30,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:24 [2018-12-09 19:08:30,248 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 25 treesize of output 20 [2018-12-09 19:08:30,251 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 20 treesize of output 21 [2018-12-09 19:08:30,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,297 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 25 treesize of output 20 [2018-12-09 19:08:30,301 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 20 treesize of output 21 [2018-12-09 19:08:30,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,352 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 25 treesize of output 20 [2018-12-09 19:08:30,356 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 20 treesize of output 21 [2018-12-09 19:08:30,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,415 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 25 treesize of output 20 [2018-12-09 19:08:30,419 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 20 treesize of output 21 [2018-12-09 19:08:30,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,473 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 25 treesize of output 20 [2018-12-09 19:08:30,476 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 20 treesize of output 21 [2018-12-09 19:08:30,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,535 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 25 treesize of output 20 [2018-12-09 19:08:30,539 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 20 treesize of output 21 [2018-12-09 19:08:30,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,588 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 25 treesize of output 20 [2018-12-09 19:08:30,592 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 20 treesize of output 21 [2018-12-09 19:08:30,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:08:30,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 19:08:30,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 19:08:30,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 19:08:30,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 19:08:30,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:13 [2018-12-09 19:08:30,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:08:30,853 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-09 19:08:30,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:30,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 19:08:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 19:08:30,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:08:30,992 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 6 treesize of output 1 [2018-12-09 19:08:30,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:31,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:31,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:32 [2018-12-09 19:08:31,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:08:31,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-12-09 19:08:31,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:08:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:08:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=635, Unknown=1, NotChecked=0, Total=702 [2018-12-09 19:08:31,699 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand 19 states. [2018-12-09 19:08:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:33,640 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2018-12-09 19:08:33,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 19:08:33,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-12-09 19:08:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:33,641 INFO L225 Difference]: With dead ends: 215 [2018-12-09 19:08:33,641 INFO L226 Difference]: Without dead ends: 215 [2018-12-09 19:08:33,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=200, Invalid=1691, Unknown=1, NotChecked=0, Total=1892 [2018-12-09 19:08:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-09 19:08:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-12-09 19:08:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-09 19:08:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 234 transitions. [2018-12-09 19:08:33,644 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 234 transitions. Word has length 80 [2018-12-09 19:08:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:33,645 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 234 transitions. [2018-12-09 19:08:33,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:08:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 234 transitions. [2018-12-09 19:08:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:08:33,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:33,645 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:08:33,645 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:08:33,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1454527126, now seen corresponding path program 3 times [2018-12-09 19:08:33,646 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:08:33,646 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 76 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:08:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:08:33,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 19:08:33,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:08:33,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:08:33,807 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-09 19:08:33,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:33,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:33,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:08:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:08:33,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:08:34,497 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-09 19:08:35,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:08:35,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:08:35,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:08:35,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 19:08:35,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:08:35,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:08:35,557 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-09 19:08:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:08:35,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:08:35,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 19:08:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-09 19:08:35,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:08:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:08:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-09 19:08:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:08:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:08:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-12-09 19:08:37,499 INFO L87 Difference]: Start difference. First operand 199 states and 234 transitions. Second operand 13 states. [2018-12-09 19:08:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:38,547 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2018-12-09 19:08:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:08:38,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-12-09 19:08:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:38,549 INFO L225 Difference]: With dead ends: 215 [2018-12-09 19:08:38,549 INFO L226 Difference]: Without dead ends: 215 [2018-12-09 19:08:38,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 19:08:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-09 19:08:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-12-09 19:08:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-09 19:08:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-12-09 19:08:38,551 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 80 [2018-12-09 19:08:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:38,551 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-12-09 19:08:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:08:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-12-09 19:08:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:08:38,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:38,552 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:08:38,552 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err1REQUIRES_VIOLATION, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err3REQUIRES_VIOLATION]=== [2018-12-09 19:08:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1093922347, now seen corresponding path program 1 times [2018-12-09 19:08:38,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:08:38,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/cvc4 Starting monitored process 78 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:08:38,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:08:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:08:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:08:40,029 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:08:40,051 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:08:40,051 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:08:40,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:08:40 BoogieIcfgContainer [2018-12-09 19:08:40,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:08:40,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:08:40,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:08:40,068 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:08:40,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:04:00" (3/4) ... [2018-12-09 19:08:40,070 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:08:40,084 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:08:40,085 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-09 19:08:40,117 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_683eafb2-7492-41b6-8976-684f0b81a00a/bin-2019/utaipan/witness.graphml [2018-12-09 19:08:40,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:08:40,118 INFO L168 Benchmark]: Toolchain (without parser) took 280206.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 939.3 MB in the beginning and 923.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 168.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:40,118 INFO L168 Benchmark]: CDTParser took 0.18 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-09 19:08:40,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:40,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.50 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-09 19:08:40,119 INFO L168 Benchmark]: Boogie Preprocessor took 23.18 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-09 19:08:40,119 INFO L168 Benchmark]: RCFGBuilder took 279.76 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:40,119 INFO L168 Benchmark]: TraceAbstraction took 279482.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Free memory was 1.1 GB in the beginning and 930.1 MB in the end (delta: 138.8 MB). Peak memory consumption was 151.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:40,119 INFO L168 Benchmark]: Witness Printer took 49.71 ms. Allocated memory is still 1.2 GB. Free memory was 930.1 MB in the beginning and 923.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:08:40,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.50 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. * Boogie Preprocessor took 23.18 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 279.76 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 279482.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.6 MB). Free memory was 1.1 GB in the beginning and 930.1 MB in the end (delta: 138.8 MB). Peak memory consumption was 151.4 MB. Max. memory is 11.5 GB. * Witness Printer took 49.71 ms. Allocated memory is still 1.2 GB. Free memory was 930.1 MB in the beginning and 923.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1460]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={97433214:0}] [L1478] CALL entry_point() VAL [ldv_global_msg_list={97433214:0}] [L1465] int i; [L1466] int len = 10; VAL [ldv_global_msg_list={97433214:0}, len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40, ldv_global_msg_list={97433214:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={-30017061:0}, ldv_global_msg_list={97433214:0}, malloc(size)={-30017061:0}, size=40] [L1467] RET, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_global_msg_list={97433214:0}, ldv_malloc(sizeof(struct A17*)*len)={-30017061:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE !(!array) [L1469] i=0 VAL [array={-30017061:0}, i=0, ldv_global_msg_list={97433214:0}, len=10] [L1469] COND TRUE i=0 VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, i=1, j=0, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1451] EXPR array[j] VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, array[j]={97392228:0}, i=1, j=0, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1451] free(array[j]) VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, array[j]={97392228:0}, i=1, j=0, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1451] free(array[j]) [L1450] j-- VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, i=1, j=4294967295, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1450] COND FALSE !(j>=0) VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, i=1, j=4294967295, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1454] return - -3; VAL [\old(len)=10, \result=3, array={-30017061:0}, array={-30017061:0}, i=1, j=4294967295, ldv_global_msg_list={97433214:0}, len=10, p={0:0}] [L1472] RET alloc_unsafe_17(array, len) VAL [alloc_unsafe_17(array, len)=3, array={-30017061:0}, i=10, ldv_global_msg_list={97433214:0}, len=10] [L1473] CALL free_17(array, len) VAL [\old(len)=10, array={-30017061:0}, ldv_global_msg_list={97433214:0}] [L1458] int i; [L1459] i=0 VAL [\old(len)=10, array={-30017061:0}, array={-30017061:0}, i=0, ldv_global_msg_list={97433214:0}, len=10] [L1459] COND TRUE i